• Schaefer's dichotomy theorem
    complexity theory, a branch of computer science, Schaefer's dichotomy theorem, proved by Thomas Jerome Schaefer, states necessary and sufficient conditions...
    12 KB (1,786 words) - 02:51, 14 October 2024
  • Schaefer's theorem
    Schaefer's theorem may refer to two unrelated theorems: Schaefer's dichotomy theorem, a theorem about the theory of NP-completeness by Thomas J. Schaefer...
    281 bytes (67 words) - 23:29, 3 September 2023
  • Boolean satisfiability problem (section Schaefer's dichotomy theorem)
    was proved to be NP-complete by Thomas Jerome Schaefer as a special case of Schaefer's dichotomy theorem, which asserts that any problem generalizing Boolean...
    53 KB (5,360 words) - 19:32, 9 March 2025
  • NP-intermediate (redirect from Ladner theorem)
    question whether any "natural" problem has the same property: Schaefer's dichotomy theorem provides conditions under which classes of constrained Boolean...
    15 KB (1,534 words) - 13:30, 1 August 2024
  • Complexity of constraint satisfaction (section Dichotomy theorems)
    question was settled in the positive for Boolean domains by Schaefer's dichotomy theorem and for any finite domain by Andrei Bulanov and Dmitriy Zhuk...
    29 KB (4,485 words) - 07:30, 19 October 2024
  • List of theorems
    (computational complexity theory) Schaefer's dichotomy theorem (computational complexity theory) Sipser–Lautemann theorem (probabilistic complexity theory)...
    78 KB (6,289 words) - 04:18, 18 March 2025
  • Not-all-equal 3-satisfiability
    are monotone (meaning that variables are never negated), by Schaefer's dichotomy theorem. Monotone NAE3SAT can also be interpreted as an instance of the...
    5 KB (641 words) - 00:53, 13 February 2025
  • Thomas Jerome Schaefer
    His Ph.D. advisor was Richard M. Karp. He is well-known for his dichotomy theorem, stating that any problem generalizing Boolean satisfiability in a...
    4 KB (177 words) - 05:40, 7 November 2024
  • Max/min CSP/Ones classification theorems
    satisfying a subset S of boolean relations. They are similar to Schaefer's dichotomy theorem, which classifies the complexity of satisfying finite sets of...
    7 KB (1,062 words) - 05:24, 4 August 2022
  • Constraint satisfaction problem
    1667058. ISSN 0004-5411. Bodirsky, Manuel; Pinsker, Michael (2011). "Schaefer's theorem for graphs". Proceedings of the 43rd Annual Symposium on Theory of...
    29 KB (3,355 words) - 13:57, 29 March 2025
  • Sharp-SAT
    variant of SAT corresponding to affine relations in the sense of Schaefer's dichotomy theorem, i.e., where clauses amount to equations modulo 2 with the XOR...
    12 KB (1,495 words) - 01:17, 1 December 2024
  • Banach space (section Banach's theorems)
    basis are the opposite cases of the dichotomy established in the following deep result of H. P. Rosenthal. Theorem—Let { x n } n ∈ N {\displaystyle \{x_{n}\}_{n\in...
    102 KB (17,005 words) - 15:38, 13 February 2025
  • Topological vector space
    retrieved 26 February 2021 Rudin 1991, p. 17 Theorem 1.22. Schaefer & Wolff 1999, pp. 12–19. Schaefer & Wolff 1999, p. 16. Narici & Beckenstein 2011...
    103 KB (13,536 words) - 12:47, 4 October 2024