Mathematical Foundations of Computer Science 2010 (Record no. 95309)

000 -LEADER
fixed length control field 06127nam a22006015i 4500
001 - CONTROL NUMBER
control field 978-3-642-15155-2
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730194735.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100814s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642151552
-- 978-3-642-15155-2
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-15155-2
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.6-76.66
072 #7 - SUBJECT CATEGORY CODE
Subject category code UM
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UM
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.11
Edition number 23
245 10 - TITLE STATEMENT
Title Mathematical Foundations of Computer Science 2010
Medium [electronic resource] :
Remainder of title 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings /
Statement of responsibility, etc. edited by Petr Hlineny, Antonin Kucera.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2010.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2010.
300 ## - PHYSICAL DESCRIPTION
Extent XVII, 714 p. 71 illus.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 6281
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note New Developments in Quantum Algorithms -- Persistent Homology under Non-uniform Error -- Information Complexity of Online Problems -- Algorithmic Lower Bounds for Problems on Decomposable Graphs -- Do We Really Understand the Crossing Numbers? -- Balanced Queries: Divide and Conquer -- Slowly Synchronizing Automata and Digraphs -- Weights of Exact Threshold Functions -- Proof Systems and Transformation Games -- Scheduling Real-Time Mixed-Criticality Jobs -- A dexptime-Complete Dolev-Yao Theory with Distributive Encryption -- On Problem Kernels for Possible Winner Determination under the k-Approval Protocol -- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time -- Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree -- Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems -- Distance Constraint Satisfaction Problems -- Faster Algorithms on Branch and Clique Decompositions -- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks -- Robust Computations with Dynamical Systems -- On Factor Universality in Symbolic Spaces -- Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity -- Resource Combinatory Algebras -- Randomness for Free -- Qualitative Analysis of Partially-Observable Markov Decision Processes -- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model -- Online Clustering with Variable Sized Clusters -- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains -- Counting Classes and the Fine Structure between NC 1 and L -- The Average Complexity of Moore's State Minimization Algorithm Is O( n loglogn) -- Connected Searching of Weighted Trees -- Iterated Regret Minimization inGame Graphs -- Properties of Visibly Pushdown Transducers -- Second-Order Algebraic Theories -- Frame Definability for Classes of Trees in the ?-calculus -- Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model -- Finding and Counting Vertex-Colored Subtrees -- Limiting Negations in Bounded Treewidth and Upward Planar Circuits -- On the Topological Complexity of MSO+U and Related Automata Models -- Least and Greatest Solutions of Equations over Sets of Integers -- Improved Simulation of Nondeterministic Turing Machines -- The Prize-Collecting Edge Dominating Set Problem in Trees -- The Multivariate Resultant Is NP-hard in Any Characteristic -- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems -- Meta-Envy-Free Cake-Cutting Protocols -- Two Variables and Two Successors -- Harnessing ML F with the Power of System F -- Describing Average- and Longtime-Behavior by Weighted MSO Logics -- Solving minones-2-sat as Fast as vertex cover -- Unambiguous Finite Automata over a Unary Alphabet -- The Complexity of Finding Reset Words in Finite Automata -- Does Treewidth Help in Modal Satisfiability? -- Asynchronous Omega-Regular Games with Partial Information -- Parity Games with Partial Information Played on Graphs of Bounded Complexity -- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets -- Enumeration of the Monomials of a Polynomial and Related Complexity Classes -- Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs -- Semi-linear Parikh Images of Regular Expressions via Reduction -- Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds -- Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences -- Counting Dependent and IndependentStrings -- Impossibility of Independence Amplification in Kolmogorov Complexity Theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer programming.
9 (RLIN) 4169
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Compilers (Computer programs).
9 (RLIN) 3350
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science.
9 (RLIN) 9832
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete mathematics.
9 (RLIN) 12873
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Programming Techniques.
9 (RLIN) 157889
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Compilers and Interpreters.
9 (RLIN) 31853
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theory of Computation.
9 (RLIN) 157890
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete Mathematics in Computer Science.
9 (RLIN) 31837
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Hlineny, Petr.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 157891
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Kucera, Antonin.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 157892
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 157893
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642151545
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642151569
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 6281
9 (RLIN) 157894
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-642-15155-2">https://doi.org/10.1007/978-3-642-15155-2</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.