Permutation Graphs and Transitive Graphs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Time Bounded Random Access Machines with Parallel Processing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Symmetric Space-Bounded Computation (Extended Abstract)
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Parallel algorithms for the transitive closure and the connected component problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The complexity of parallel computations
The complexity of parallel computations
Graph Theory With Applications
Graph Theory With Applications
ACM Computing Surveys (CSUR)
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An overview of computational complexity
Communications of the ACM
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Languages which capture complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An overview of computational complexity
ACM Turing award lectures
| Hi-index | 0.02 |
This paper introduces a class of 1 player games of perfect information, which we call complementing games;; the player is allowed moves which complement the value of successive plays. A complementing game is symmetric if all noncomplement moves are reversible (i.e., form a symmetric relation). These games are naturally related to a class of machines we call symmetric complementing machines. Symmetric nondeterministic machines were studied in [Lewis and Papadimitriou, 80]; they are identical to our symmetric complementing machines with complement moves allowed only on termination. (A companion paper to appear describes the computational complexity of symmetric complementing and alternating machines.) Of particular interest is the complexity class -&-Sgr;(@@@@) CSYMLOG, which contains the outcome problem of symmetric complementing games with constant complement bound with game positions encoded in log space, and next move relations computable in log space. We show that the decision problem for a restricted quantified Boolean logic -&-Sgr;(@@@@) QBF@@@@ is complete in -&-Sgr;(@@@@) CSYMLOG.