Michael H. Freedman
- B.R. Bergen, The undecidability of the domino problem, Mem. Amer. Math. See. 66 (i 966).Google Scholar
- Bu.A. Burr, Some undecidable problems involving the edge-coloring and vertex-coloring of graphs, Discrete Math. 50 (1984) 171.Google ScholarCross Ref
- C.S.A. Cook, A hierarchy of nondeterministic time complexity, Fourth Annual ACM Symposium on the Theory of Computing (Denver, Colorado, 1972), J. Cornput. System Sci. 7 (1973), 343. Google ScholarDigital Library
- F.M. Freedman, Limit, Logic, and Computatioll, Prec. Natl. Acad. Sci. 95 (1998) 95.Google ScholarCross Ref
- GJ.M. Garey and D. Johnson, Computers attd intractabil. ity: A guide to the theory of NP-completeness, W.H. Freeman and Company, 1979. Google ScholarDigital Library
- K.R.M. Karp, Reducibility among combinatorial prob. lems, Complexity of Computer Computations (R.E. Miller and J. W. Thatcher, eds.), Plenum Press, 1972, pp. 85-103.Google Scholar
- R1.R. Robinson, Undecidable tiling problems in the hy. perbolic plane, Invent Math. 44 (1978), 259.Google ScholarCross Ref
- R2.R. Robinson, Undecidability and nonperiodicity for tilings of the plane, Invent. Math. 12 (1971, 209.Google ScholarCross Ref
- W.H. Wang, Proving theorems by pattern recognition --- II, Bell System Teeh. J. 40 (1961).Google Scholar
Index Terms
- K-sat on groups and undecidability
Recommendations
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason ...
Clause elimination for SAT and QSAT
The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarative programming paradigms through which real-world instances of ...
Improving SAT using 2SAT
Propositional satisfiability (SAT) is a fundamental problem of immense practical importance. While SAT is NP-complete when clauses can contain 3 literals or more, the problem can be solved in linear time when the given formula contains only binary ...
Comments