↓ Skip to main content

Theory and applications of models of computation : 5th international conference, TAMC 2008, Xi'an, China, April 25-29, 2008 ; proceedings

Overview of attention for book
Cover of 'Theory and applications of models of computation : 5th international conference, TAMC 2008, Xi'an, China, April 25-29, 2008 ; proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Differential Privacy: A Survey of Results
  3. Altmetric Badge
    Chapter 2 On the Complexity of Measurement in Classical Physics
  4. Altmetric Badge
    Chapter 3 Quantum Walk Based Search Algorithms
  5. Altmetric Badge
    Chapter 4 Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
  6. Altmetric Badge
    Chapter 5 Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons
  7. Altmetric Badge
    Chapter 6 On the Complexity of the Hidden Subgroup Problem
  8. Altmetric Badge
    Chapter 7 An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
  9. Altmetric Badge
    Chapter 8 Indistinguishability and First-Order Logic
  10. Altmetric Badge
    Chapter 9 Derandomizing Graph Tests for Homomorphism
  11. Altmetric Badge
    Chapter 10 Definable Filters in the Structure of Bounded Turing Reductions
  12. Altmetric Badge
    Chapter 11 Distance Constrained Labelings of Trees
  13. Altmetric Badge
    Chapter 12 A Characterization of NC k by First Order Functional Programs
  14. Altmetric Badge
    Chapter 13 The Structure of Detour Degrees
  15. Altmetric Badge
    Chapter 14 Hamiltonicity of Matching Composition Networks with Conditional Edge Faults
  16. Altmetric Badge
    Chapter 15 Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs
  17. Altmetric Badge
    Chapter 16 Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity
  18. Altmetric Badge
    Chapter 17 More on Weak Bisimilarity of Normed Basic Parallel Processes
  19. Altmetric Badge
    Chapter 18 Extensions of Embeddings in the Computably Enumerable Degrees
  20. Altmetric Badge
    Chapter 19 An Improved Parameterized Algorithm for a Generalized Matching Problem
  21. Altmetric Badge
    Chapter 20 Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
  22. Altmetric Badge
    Chapter 21 Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
  23. Altmetric Badge
    Chapter 22 Ratio Based Stable In-Place Merging
  24. Altmetric Badge
    Chapter 23 A Characterisation of the Relations Definable in Presburger Arithmetic
  25. Altmetric Badge
    Chapter 24 Finding Minimum 3-Way Cuts in Hypergraphs
  26. Altmetric Badge
    Chapter 25 Inapproximability of Maximum Weighted Edge Biclique and Its Applications
  27. Altmetric Badge
    Chapter 26 Symbolic Algorithm Analysis of Rectangular Hybrid Systems
  28. Altmetric Badge
    Chapter 27 On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
  29. Altmetric Badge
    Chapter 28 Logical Closure Properties of Propositional Proof Systems
  30. Altmetric Badge
    Chapter 29 Graphs of Linear Clique-Width at Most 3
  31. Altmetric Badge
    Chapter 30 A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds
  32. Altmetric Badge
    Chapter 31 A Logic for Distributed Higher Order π-Calculus
  33. Altmetric Badge
    Chapter 32 Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
  34. Altmetric Badge
    Chapter 33 A Topological Study of Tilings
  35. Altmetric Badge
    Chapter 34 A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
  36. Altmetric Badge
    Chapter 35 Weak Bisimulations for the Giry Monad (Extended Abstract)
  37. Altmetric Badge
    Chapter 36 Theory and Applications of Models of Computation
  38. Altmetric Badge
    Chapter 37 On a Question of Frank Stephan
  39. Altmetric Badge
    Chapter 38 A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF
  40. Altmetric Badge
    Chapter 39 Improved Algorithms for Bicluster Editing
  41. Altmetric Badge
    Chapter 40 Generation Complexity Versus Distinction Complexity
  42. Altmetric Badge
    Chapter 41 Balancing Traffic Load Using One-Turn Rectilinear Routing
  43. Altmetric Badge
    Chapter 42 A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
  44. Altmetric Badge
    Chapter 43 Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
  45. Altmetric Badge
    Chapter 44 A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
  46. Altmetric Badge
    Chapter 45 Model Theoretic Complexity of Automatic Structures (Extended Abstract)
  47. Altmetric Badge
    Chapter 46 A Separation between Divergence and Holevo Information for Ensembles
  48. Altmetric Badge
    Chapter 47 Unary Automatic Graphs: An Algorithmic Perspective
  49. Altmetric Badge
    Chapter 48 Search Space Reductions for Nearest-Neighbor Queries
  50. Altmetric Badge
    Chapter 49 Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees
  51. Altmetric Badge
    Chapter 50 s-Degrees within e-Degrees
  52. Altmetric Badge
    Chapter 51 The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
Attention for Chapter 28: Logical Closure Properties of Propositional Proof Systems
Altmetric Badge
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Logical Closure Properties of Propositional Proof Systems
Chapter number 28
Book title
Theory and Applications of Models of Computation
Published by
Springer, Berlin, Heidelberg, April 2008
DOI 10.1007/978-3-540-79228-4_28
Book ISBNs
978-3-54-079227-7, 978-3-54-079228-4
Authors

Olaf Beyersdorff