000 | 06256nam a22006735i 4500 | ||
---|---|---|---|
001 | 978-3-540-45138-9 | ||
003 | DE-He213 | ||
005 | 20240423132432.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540451389 _9978-3-540-45138-9 |
||
024 | 7 |
_a10.1007/b11836 _2doi |
|
050 | 4 | _aTK7885-7895 | |
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUK _2bicssc |
|
072 | 7 |
_aCOM067000 _2bisacsh |
|
072 | 7 |
_aUK _2thema |
|
082 | 0 | 4 |
_a621.39 _223 |
082 | 0 | 4 |
_a004.6 _223 |
245 | 1 | 0 |
_aMathematical Foundations of Computer Science 2003 _h[electronic resource] : _b28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings / _cedited by Branislav Rovan, Peter Vojtas. |
250 | _a1st ed. 2003. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
300 |
_aXIII, 692 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, _x1611-3349 ; _v2747 |
|
505 | 0 | _aInvited Talks -- Distributed Quantum Computing -- Selfish Routing in Non-cooperative Networks: A Survey -- Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols -- Semantic and Syntactic Approaches to Simulation Relations -- On the Computational Complexity of Conservative Computing -- Constructing Infinite Graphs with a Decidable MSO-Theory -- Towards a Theory of Randomized Search Heuristics -- Contributed Papers -- Adversarial Models for Priority-Based Networks -- On Optimal Merging Networks -- Problems which Cannot Be Reduced to Any Proper Subproblems -- ACID-Unification Is NEXPTIME-Decidable -- Completeness in Differential Approximation Classes -- On the Length of the Minimum Solution of Word Equations in One Variable -- Smoothed Analysis of Three Combinatorial Problems -- Inferring Strings from Graphs and Arrays -- Faster Algorithms for k-Medians in Trees -- Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies -- Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms -- Error-Bounded Probabilistic Computations between MA and AM -- A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves -- Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation -- Denotational Testing Semantics in Coinductive Form -- Lower Bounds for General Graph–Driven Read–Once Parity Branching Programs -- The Minimal Graph Model of Lambda Calculus -- Unambiguous Automata on Bi-infinite Words -- Relating Hierarchy of Temporal Properties to Model Checking -- Arithmetic Constant-Depth Circuit Complexity Classes -- Inverse NP Problems -- A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs -- Generalized Satisfiability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity.-Randomized Algorithms for Determining the Majority on Graphs -- Using Transitive–Closure Logic for Deciding Linear Properties of Monoids -- Linear-Time Computation of Local Periods -- Two Dimensional Packing: The Power of Rotation -- Approximation Schemes for the Min-Max Starting Time Problem -- Quantum Testers for Hidden Group Properties -- Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces -- LTL with Past and Two-Way Very-Weak Alternating Automata -- Match-Bounded String Rewriting Systems -- Probabilistic and Nondeterministic Unary Automata -- On Matroid Properties Definable in the MSO Logic -- Characterizations of Catalytic Membrane Computing Systems -- Augmenting Local Edge-Connectivity between Vertices and Vertex Subsets in Undirected Graphs -- Scheduling and Traffic Allocation for Tasks with Bounded Splittability -- Computing Average Value in Ad Hoc Networks -- A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes -- Solving the Sabotage Game Is PSPACE-Hard -- The Approximate Well-Founded Semantics for Logic Programs with Uncertainty -- Which Is the Worst-Case Nash Equilibrium? -- A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory -- Generic Algorithms for the Generation of Combinatorial Objects -- On the Complexity of Some Problems in Interval Arithmetic -- An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources -- On Selection Functions that Do Not Preserve Normality -- On Converting CNF to DNF -- A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum -- On the Complexity of Some Equivalence Problems for Propositional Calculi -- Quantified Mu-Calculus for Control Synthesis -- On Probabilistic Quantified SatisfiabilityGames -- A Completeness Property of Wilke’s Tree Algebras -- Symbolic Topological Sorting with OBDDs -- Ershov’s Hierarchy of Real Numbers. | |
650 | 0 | _aComputer engineering. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aComputer science. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aComputer Engineering and Networks. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aData Science. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aRovan, Branislav. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aVojtas, Peter. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540406716 |
776 | 0 | 8 |
_iPrinted edition: _z9783662187616 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2747 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b11836 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c187726 _d187726 |