000 06680nam a22005895i 4500
001 978-3-540-31867-5
003 DE-He213
005 20240730192651.0
007 cr nn 008mamaa
008 100722s2005 gw | s |||| 0|eng d
020 _a9783540318675
_9978-3-540-31867-5
024 7 _a10.1007/11549345
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aMathematical Foundations of Computer Science 2005
_h[electronic resource] :
_b30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings /
_cedited by Joanna Jedrzejowicz, Andrzej Szepietowski.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXVI, 814 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3618
505 0 _aInvited Lectures -- Page Migration in Dynamic Networks -- Knot Theory, Jones Polynomial and Quantum Computing -- Interactive Algorithms 2005 -- Some Computational Issues in Membrane Computing -- The Generalization of Dirac's Theorem for Hypergraphs -- On the Communication Complexity of Co-linearity Problems -- An Invitation to Play -- Papers -- The Complexity of Satisfiability Problems: Refining Schaefer's Theorem -- On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions -- Pure Nash Equilibria in Games with a Large Number of Actions -- On the Complexity of Depth-2 Circuits with Threshold Gates -- Isomorphic Implication -- Abstract Numeration Systems and Tilings -- Adversarial Queueing Model for Continuous Network Dynamics -- Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time -- Regular Sets of Higher-Order Pushdown Stacks -- Linearly Bounded Infinite Graphs -- Basic Properties for Sand Automata -- A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs -- Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix -- New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling -- Approximating Polygonal Objects by Deformable Smooth Surfaces -- Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications -- Asynchronous Deterministic Rendezvous in Graphs -- Zeta-Dimension -- Online Interval Coloring with Packing Constraints -- Separating the Notions of Self- and Autoreducibility -- Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata -- Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs -- Matrix and Graph Orders Derived from Locally ConstrainedGraph Homomorphisms -- Packing Weighted Rectangles into a Square -- Nondeterministic Graph Searching: From Pathwidth to Treewidth -- Goals in the Propositional Horn??? Language Are Monotone Boolean Circuits -- Autoreducibility, Mitoticity, and Immunity -- Canonical Disjoint NP-Pairs of Propositional Proof Systems -- Complexity of DNF and Isomorphism of Monotone Formulas -- The Expressive Power of Two-Variable Least Fixed-Point Logics -- Languages Representable by Vertex-Labeled Graphs -- On the Complexity of Mixed Discriminants and Related Problems -- Two Logical Hierarchies of Optimization Problems over the Real Numbers -- Algebras as Knowledge Structures -- Combining Self-reducibility and Partial Information Algorithms -- Complexity Bounds for Regular Games -- Basic Mereology with Equivalence Relations -- Online and Dynamic Recognition of Squarefree Strings -- Shrinking Restarting Automata -- Removing Bidirectionality from Nondeterministic Finite Automata -- Generating All Minimal Integral Solutions to Monotone ?,?-Systems of Linear, Transversal and Polymatroid Inequalities -- On the Parameterized Complexity of Exact Satisfiability Problems -- Approximating Reversal Distance for Strings with Bounded Number of Duplicates -- Random Databases and Threshold for Monotone Non-recursive Datalog -- An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems -- Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing -- Tight Approximability Results for the Maximum Solution Equation Problem over Z p -- The Complexity of Model Checking Higher Order Fixpoint Logic -- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules -- Inverse Monoids: Decidability and Complexity of Algebraic Questions -- Dimension IsCompression -- Concurrent Automata vs. Asynchronous Systems -- Completeness and Degeneracy in Information Dynamics of Cellular Automata -- Strict Language Inequalities and Their Decision Problems -- Event Structures for the Collective Tokens Philosophy of Inhibitor Nets -- An Exact 2.9416 n Algorithm for the Three Domatic Number Problem -- D-Width: A More Natural Measure for Directed Tree Width -- On Beta-Shifts Having Arithmetical Languages -- A BDD-Representation for the Logic of Equality and Uninterpreted Functions -- On Small Hard Leaf Languages -- Explicit Inapproximability Bounds for the Shortest Superstring Problem -- Stratified Boolean Grammars.
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aTheory of Computation.
_9150837
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Science.
_934092
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
700 1 _aJedrzejowicz, Joanna.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150838
700 1 _aSzepietowski, Andrzej.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150839
710 2 _aSpringerLink (Online service)
_9150840
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540287025
776 0 8 _iPrinted edition:
_z9783540815129
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3618
_9150841
856 4 0 _uhttps://doi.org/10.1007/11549345
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94371
_d94371