SIGACT news complexity theory column 42
Author:
Open Access
- 1 December 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 34 (4) , 38-52
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On the Complexity of Some Equivalence Problems for Propositional Calculi2003
- The Complexity of Minimal Satisfiability ProblemsLecture Notes in Computer Science, 2001
- Satisfiability problems for propositional calculiTheory of Computing Systems, 1979
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Boolesche Funktionen und Postsche Klassen1970