Satisfiability Is Quasilinear Complete in NQL
- 1 January 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 25 (1), 136-145
- https://doi.org/10.1145/322047.322060
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A lower bound on the number of additions in monotone computationsTheoretical Computer Science, 1976
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- Komplexität von Entscheidungsproblemen Ein SeminarLecture Notes in Computer Science, 1976
- A hierarchy for nondeterministic time complexityPublished by Association for Computing Machinery (ACM) ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Two-Tape Simulation of Multitape Turing MachinesJournal of the ACM, 1966