|
|
|
|
LEADER |
05033nmm a2200457 u 4500 |
001 |
EB002219704 |
003 |
EBX01000000000000001356665 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
240702 ||| eng |
020 |
|
|
|a 9783540458418
|
100 |
1 |
|
|a Alt, Helmut
|e [editor]
|
245 |
0 |
0 |
|a STACS 2002
|h Elektronische Ressource
|b 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings
|c edited by Helmut Alt, Afonso Ferreira
|
250 |
|
|
|a 1st ed. 2002
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2002, 2002
|
300 |
|
|
|a XIV, 660 p
|b online resource
|
505 |
0 |
|
|a Invited Papers -- Hyper-Encryption and Everlasting Security -- Models and Techniques for Communication in Dynamic Networks -- What Is a Theory? -- Algorithms -- A Space Lower Bound for Routing in Trees -- Labeling Schemes for Dynamic Tree Networks -- Tight Bounds for the Performance of Longest-in-System on DAGs -- Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling -- Balanced Coloring: Equally Easy for All Numbers of Colors? -- The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 -- On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets -- On Dualization in Products of Forests -- An Asymptotic (ln ?/ ln ln ?)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs -- Scheduling at Twilight the EasyWay -- Complexity of Multi-dimensional Loop Alignment -- A Probabilistic 3—SAT Algorithm Further Improved --
|
505 |
0 |
|
|a How Many Missing Answers Can Be Tolerated by Query Learners? -- Games with a Uniqueness Property -- Bi-Immunity Separates Strong NP-Completeness Notions -- Complexity of Semi-algebraic Proofs -- A Lower Bound Technique for Restricted Branching Programs and Applications -- The Complexity of Constraints on Intervals and Lengths -- Automata and Formal Languages -- Nesting Until and Since in Linear Temporal Logic -- Comparing Verboseness for Finite Automata and Turing Machines -- On the Average Parallelism in Trace Monoids -- A Further Step towards a Theory of Regular MSC Languages -- Existential and Positive Theories of Equations in Graph Products -- The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL -- Recognizable Sets of Message Sequence Charts -- Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard -- On the Enumerative Sequences of Regular Languages on k Symbols -- Logic in Computer Science --
|
505 |
0 |
|
|a Ground Tree Rewriting Graphs of Bounded Tree Width -- Timed Control Synthesis for External Specifications -- Axiomatizing GSOS with Termination -- Axiomatising Tree-Interpretable Structures -- EXPSPACE-Complete Variant of Guarded Fragment with Transitivity -- A Parametric Analysis of the State Explosion Problem in Model Checking -- Generalized Model-Checking over Locally Tree-Decomposable Classes -- Learnability and Definability in Trees and Similar Structures
|
505 |
0 |
|
|a The Secret of Selective Game Tree Search, When Using Random-Error Evaluations -- Randomized Acceleration of Fundamental Matrix Computations -- Approximations for ATSP with Parametrized Triangle Inequality -- A New Diagram from Disks in the Plane -- Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles -- Current Challenges -- On the Parameterized Intractability of Closest Substring and Related Problems -- On the Complexity of Protein Similarity Search under mRNA Structure Constraints -- Pure Dominance Constraints -- Improved Quantum Communication Complexity Bounds for Disjointness and Equality -- On Quantum Computation with Some Restricted Amplitudes -- A Quantum Goldreich-Levin Theorem with Cryptographic Applications -- On Quantum and Approximate Privacy -- On Quantum Versions of the Yao Principle.-Computational and Structural Complexity -- Describing Parameterized Complexity Classes -- On the Computational Power of Boolean Decision Lists --
|
653 |
|
|
|a Artificial intelligence / Data processing
|
653 |
|
|
|a Computer graphics
|
653 |
|
|
|a Computer science
|
653 |
|
|
|a Computer science / Mathematics
|
653 |
|
|
|a Discrete Mathematics in Computer Science
|
653 |
|
|
|a Computer Graphics
|
653 |
|
|
|a Data Structures and Information Theory
|
653 |
|
|
|a Application software
|
653 |
|
|
|a Information theory
|
653 |
|
|
|a Data structures (Computer science)
|
653 |
|
|
|a Discrete mathematics
|
653 |
|
|
|a Computer and Information Systems Applications
|
653 |
|
|
|a Theory of Computation
|
653 |
|
|
|a Data Science
|
700 |
1 |
|
|a Ferreira, Afonso
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
490 |
0 |
|
|a Lecture Notes in Computer Science
|
028 |
5 |
0 |
|a 10.1007/3-540-45841-7
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45841-7?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 004.0151
|