↓ Skip to main content

Theory and Applications of Models of Computation

Overview of attention for book
Cover of 'Theory and Applications of Models of Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
  3. Altmetric Badge
    Chapter 2 Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures
  4. Altmetric Badge
    Chapter 3 Approximation Algorithms for 3D Orthogonal Knapsack
  5. Altmetric Badge
    Chapter 4 A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences
  6. Altmetric Badge
    Chapter 5 The Hardness of Selective Network Design for Bottleneck Routing Games
  7. Altmetric Badge
    Chapter 6 A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
  8. Altmetric Badge
    Chapter 7 Elementary Differences Among Jump Hierarchies
  9. Altmetric Badge
    Chapter 8 Working with the LR Degrees
  10. Altmetric Badge
    Chapter 9 Computability on Subsets of Locally Compact Spaces
  11. Altmetric Badge
    Chapter 10 A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
  12. Altmetric Badge
    Chapter 11 Finding a Duplicate and a Missing Item in a Stream
  13. Altmetric Badge
    Chapter 12 Directed Searching Digraphs: Monotonicity and Complexity
  14. Altmetric Badge
    Chapter 13 Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem
  15. Altmetric Badge
    Chapter 14 Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing
  16. Altmetric Badge
    Chapter 15 A Provably Secure Blind Signature Scheme
  17. Altmetric Badge
    Chapter 16 Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2)
  18. Altmetric Badge
    Chapter 17 New Left-to-Right Radix- r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems
  19. Altmetric Badge
    Chapter 18 The Strongest Nonsplitting Theorem
  20. Altmetric Badge
    Chapter 19 There is an Sw-Cuppable Strongly c.e. Real
  21. Altmetric Badge
    Chapter 20 On Computation Complexity of the Concurrently Enabled Transition Set Problem
  22. Altmetric Badge
    Chapter 21 Synchronization of Some DFA
  23. Altmetric Badge
    Chapter 22 On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
  24. Altmetric Badge
    Chapter 23 On Exact Complexity of Subgraph Homeomorphism
  25. Altmetric Badge
    Chapter 24 Searching a Polygonal Region by Two Guards
  26. Altmetric Badge
    Chapter 25 On the Internal Steiner Tree Problem
  27. Altmetric Badge
    Chapter 26 Approximately Optimal Trees for Group Key Management with Batch Updates
  28. Altmetric Badge
    Chapter 27 On Deciding Deep Holes of Reed-Solomon Codes
  29. Altmetric Badge
    Chapter 28 Quantum Multiparty Communication Complexity and Circuit Lower Bounds
  30. Altmetric Badge
    Chapter 29 Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions
  31. Altmetric Badge
    Chapter 30 Improving the Average Delay of Sorting
  32. Altmetric Badge
    Chapter 31 Approximating Capacitated Tree-Routings in Networks
  33. Altmetric Badge
    Chapter 32 Feedback Arc Set Problem in Bipartite Tournaments
  34. Altmetric Badge
    Chapter 33 Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network
  35. Altmetric Badge
    Chapter 34 Enhancing Simulation for Checking Language Containment
  36. Altmetric Badge
    Chapter 35 QBF-Based Symbolic Model Checking for Knowledge and Time
  37. Altmetric Badge
    Chapter 36 A Characterization of the Language Classes Learnable with Correction Queries
  38. Altmetric Badge
    Chapter 37 Learnable Algorithm on the Continuum
  39. Altmetric Badge
    Chapter 38 Online Deadline Scheduling with Bounded Energy Efficiency
  40. Altmetric Badge
    Chapter 39 Efficient Algorithms for Airline Problem
  41. Altmetric Badge
    Chapter 40 Efficient Exact Arithmetic over Constructive Reals
  42. Altmetric Badge
    Chapter 41 Bounding Run-Times of Local Adiabatic Algorithms
  43. Altmetric Badge
    Chapter 42 A Note on Universal Composable Zero Knowledge in Common Reference String Model
  44. Altmetric Badge
    Chapter 43 A Note on the Feasibility of Generalized Universal Composability
  45. Altmetric Badge
    Chapter 44 t -Private and Secure Auctions
  46. Altmetric Badge
    Chapter 45 Secure Multiparty Computations Using a Dial Lock
  47. Altmetric Badge
    Chapter 46 A Time Hierarchy Theorem for Nondeterministic Cellular Automata
  48. Altmetric Badge
    Chapter 47 Decidability of Propositional Projection Temporal Logic with Infinite Models
  49. Altmetric Badge
    Chapter 48 Separation of Data Via Concurrently Determined Discriminant Functions
  50. Altmetric Badge
    Chapter 49 The Undecidability of the Generalized Collatz Problem
  51. Altmetric Badge
    Chapter 50 Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces
  52. Altmetric Badge
    Chapter 51 Maximum Edge-Disjoint Paths Problem in Planar Graphs
  53. Altmetric Badge
    Chapter 52 An Efficient Algorithm for Generating Colored Outerplanar Graphs
  54. Altmetric Badge
    Chapter 53 Orthogonal Drawings for Plane Graphs with Specified Face Areas
  55. Altmetric Badge
    Chapter 54 Absolutely Non-effective Predicates and Functions in Computable Analysis
  56. Altmetric Badge
    Chapter 55 Linear-Size Log-Depth Negation-Limited Inverter for k -Tonic Binary Sequences
  57. Altmetric Badge
    Chapter 56 The Existence of Unsatisfiable Formulas in k -LCNF for k  ≥ 3
  58. Altmetric Badge
    Chapter 57 Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model
  59. Altmetric Badge
    Chapter 58 Phase Transition of Multivariate Polynomial Systems
  60. Altmetric Badge
    Chapter 59 Approximation Algorithms for Maximum Edge Coloring Problem
  61. Altmetric Badge
    Chapter 60 Two Improved Range-Efficient Algorithms for F 0 Estimation
  62. Altmetric Badge
    Chapter 61 Approximation to the Minimum Rooted Star Cover Problem
  63. Altmetric Badge
    Chapter 62 Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
  64. Altmetric Badge
    Chapter 63 Parameterized Algorithms for Weighted Matching and Packing Problems
  65. Altmetric Badge
    Chapter 64 Kernelizations for Parameterized Counting Problems
  66. Altmetric Badge
    Chapter 65 Revisiting the Impossibility for Boosting Service Resilience
  67. Altmetric Badge
    Chapter 66 An Approximation Algorithm to the k -Steiner Forest Problem
  68. Altmetric Badge
    Chapter 67 A Distributed Algorithm of Fault Recovery for Stateful Failover
  69. Altmetric Badge
    Chapter 68 Path Embedding on Folded Hypercubes
  70. Altmetric Badge
    Chapter 69 An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
Attention for Chapter 35: QBF-Based Symbolic Model Checking for Knowledge and Time
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 Mendeley
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
QBF-Based Symbolic Model Checking for Knowledge and Time
Chapter number 35
Book title
Theory and Applications of Models of Computation
Published by
Springer, Berlin, Heidelberg, May 2007
DOI 10.1007/978-3-540-72504-6_35
Book ISBNs
978-3-54-072503-9, 978-3-54-072504-6
Authors

Conghua Zhou, Zhenyu Chen, Zhihong Tao

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 100%
Readers by discipline Count As %
Computer Science 1 100%