An O(T log T) reduction from RAM computations to satisfiability
- 1 May 1991
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 82 (1) , 141-149
- https://doi.org/10.1016/0304-3975(91)90177-4
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Short propositional formulas represent nondeterministic computationsInformation Processing Letters, 1988
- Sorting inc logn parallel stepsCombinatorica, 1983