000 | 05586nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-44683-5 | ||
003 | DE-He213 | ||
005 | 20160624101951.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2001 gw | s |||| 0|eng d | ||
020 |
_a9783540446835 _9978-3-540-44683-5 |
||
024 | 7 |
_a10.1007/3-540-44683-4 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aMathematical Foundations of Computer Science 2001 _h[electronic resource] : _b26th International Symposium, MFCS 2001 Mariánské Lázne, Czech Republic, August 27–31, 2001 Proceedings / _cedited by Jiří Sgall, Aleš Pultr, Petr Kolman. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2001. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2001. |
|
300 |
_aXII, 718 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2136 |
|
505 | 0 | _aInvited Talks -- A New Category for Semantics -- On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity -- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory -- Some Recent Results on Data Mining and Search -- Hypertree Decompositions: A Survey -- The Strength of Non-size-increasing Computation (Introduction and Summary) -- to Recent Quantum Algorithms -- Decomposition Methods and Sampling Circuits in the Cartesian Lattice -- New Algorithms for k-SAT Based on the Local Search Principle -- Linear Temporal Logic and Finite Semigroups -- Contributed Talks -- Refined Search Tree Technique for Dominating Set on Planar Graphs -- The Computational Power of a Family of Decision Forests -- Exact Results for Accepting Probabilities of Quantum Automata -- Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms -- Analysis Problems for Sequential Dynamical Systems and Communicating State Machines -- The Complexity of Tensor Circuit Evaluation -- Computing Reciprocals of Bivariate Power Series -- Automatic Verification of Recursive Procedures with One Integer Parameter -- Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds -- Computable Versions of Baire’s Category Theorem -- Automata on Linear Orderings -- Algorithmic Information Theory and Cellular Automata Dynamics -- The k-Median Problem for Directed Trees -- On Pseudorandom Generators in NC0 -- There Are No Sparse NPw-Hard Sets -- Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio -- (H,C,K) -Coloring: Fast, Easy, and Hard Cases -- Randomness and Reductibility -- On the Computational Complexity of Infinite Words -- Lower Bounds for On-Line Single-Machine Scheduling -- Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings -- A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing -- Quantifier Rank for Parity of Embedded Finite Models -- Space Hierarchy Theorem Revised -- Converting Two—Way Nondeterministic Unary Automata into Simpler Automata -- The Complexity of the Minimal Polynomial -- Note on Minimal Finite Automata -- Synchronizing Finite Automata on Eulerian Digraphs -- A Time Hierarchy for Bounded One-Way Cellular Automata -- Checking Amalgamability Conditions forCasl Architectural Specifications -- On-Line Scheduling with Tight Deadlines -- Complexity Note on Mixed Hypergraphs -- News from the Online Traveling Repairman -- Word Problems for 2-Homogeneous Monoids and Symmetric Logspace -- Variations on a Theorem of Fine & Wilf -- Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs -- Satisfiability of Systems of Equations over Finite Monoids -- Rational Graphs Trace Context-Sensitive Languages -- Towards Regular Languages over Infinite Alphabets -- Partial Information and Special Case Algorithms -- The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs -- From Bidirectionality to Alternation -- Syntactic Semiring of a Language -- On Reducibility and Symmetry of Disjoint NP-Pairs -- Hierarchy of Monotonically Computable Real Numbers -- On the Equational Definition of the Least Prefixed Point -- On the Periods of Partial Words -- The Size of Power Automata -- On the Approximability of the Steiner Tree Problem -- Alignment between Two RNA Structures -- Characterization of Context-Free Languages with Polynomially Bounded Ambiguity. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aInformation theory. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aMathematics of Computing. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aSgall, Jiří. _eeditor. |
|
700 | 1 |
_aPultr, Aleš. _eeditor. |
|
700 | 1 |
_aKolman, Petr. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540424963 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2136 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-44683-4 |
942 |
_2EBK4959 _cEBK |
||
999 |
_c34253 _d34253 |