000 06350nam a22006255i 4500
001 978-3-540-79228-4
003 DE-He213
005 20240423125720.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540792284
_9978-3-540-79228-4
024 7 _a10.1007/978-3-540-79228-4
_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 _aTheory and Applications of Models of Computation
_h[electronic resource] :
_b5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008, Proceedings /
_cedited by Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXII, 598 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 ;
_v4978
505 0 _aPlenary Lectures -- Differential Privacy: A Survey of Results -- Special Session Lectures -- On the Complexity of Measurement in Classical Physics -- Quantum Walk Based Search Algorithms -- Contributed Lectures -- Propositional Projection Temporal Logic, B chi Automata and ?-Regular Expressions -- Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons -- On the Complexity of the Hidden Subgroup Problem -- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing -- Indistinguishability and First-Order Logic -- Derandomizing Graph Tests for Homomorphism -- Definable Filters in the Structure of Bounded Turing Reductions -- Distance Constrained Labelings of Trees -- A Characterization of NC k by First Order Functional Programs -- The Structure of Detour Degrees -- Hamiltonicity of Matching Composition Networks with Conditional Edge Faults -- Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs -- Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity -- More on Weak Bisimilarity of Normed Basic Parallel Processes -- Extensions of Embeddings in the Computably Enumerable Degrees -- An Improved Parameterized Algorithm for a Generalized Matching Problem -- Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus -- Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences -- Ratio Based Stable In-Place Merging -- A Characterisation of the Relations Definable in Presburger Arithmetic -- Finding Minimum 3-Way Cuts in Hypergraphs -- Inapproximability of Maximum Weighted Edge Biclique and Its Applications -- Symbolic Algorithm Analysis of Rectangular Hybrid Systems -- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication -- Logical Closure Properties of Propositional ProofSystems -- Graphs of Linear Clique-Width at Most 3 -- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds -- A Logic for Distributed Higher Order ?-Calculus -- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs -- A Topological Study of Tilings -- A Denotational Semantics for Total Correctness of Sequential Exact Real Programs -- Weak Bisimulations for the Giry Monad (Extended Abstract) -- Approximating Border Length for DNA Microarray Synthesis -- On a Question of Frank Stephan -- A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF -- Improved Algorithms for Bicluster Editing -- Generation Complexity Versus Distinction Complexity -- Balancing Traffic Load Using One-Turn Rectilinear Routing -- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree -- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems -- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable -- Model Theoretic Complexity of Automatic Structures (Extended Abstract) -- A Separation between Divergence and Holevo Information for Ensembles -- Unary Automatic Graphs: An Algorithmic Perspective -- Search Space Reductions for Nearest-Neighbor Queries -- Total Degrees and Nonsplitting Properties of Enumeration Degrees -- s-Degrees within e-Degrees -- The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees.
520 _aThis book constitutes the refereed proceedings of the 5th International Conference on Theory and Applications of Models of Computation, TAMC 2008, held in Xi'an, China in April 2008. The 48 revised full papers presented together with 2 invited talks and 1 plenary lecture were carefully reviewed and selected from 192 submissions. The papers address current issues of all major areas in computer science, mathematics (especially logic) and the physical sciences - computation, algorithms, complexity and computability theory in particular. With this crossdisciplinary character the conference is given a special flavor and distinction.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence.
650 0 _aComputer science
_xMathematics.
650 0 _aBioinformatics.
650 1 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aArtificial Intelligence.
650 2 4 _aMathematics of Computing.
650 2 4 _aComputational and Systems Biology.
700 1 _aAgrawal, Manindra.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDu, Ding-Zhu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDuan, Zhenhua.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLi, Angsheng.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540792277
776 0 8 _iPrinted edition:
_z9783540849810
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4978
856 4 0 _uhttps://doi.org/10.1007/978-3-540-79228-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c180953
_d180953