Symmetric Complementation

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.

[1]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[3]  Joseph JáJá,et al.  Parallel Algorithms in Graph Theory: Planarity Testing , 1982, SIAM J. Comput..

[4]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[6]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[7]  A. White.  Graphs, Groups and Surfaces , 1973 .

[8]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation (Extended Abstract) , 1980, ICALP.

[9]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[10]  Walter J. Savitch,et al.  Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.

[11]  A. Lempel,et al.  Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[12]  Saunders Mac Lane,et al.  A combinatorial condition for planar graphs , 1937 .

[13]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[14]  Stephen A. Cook,et al.  Hardware complexity and parallel computation , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[15]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[16]  Daniel S. Hirschberg,et al.  Parallel algorithms for the transitive closure and the connected component problems , 1976, STOC '76.

[17]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[18]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[19]  John H. Reif,et al.  On the Power of Probabilistic Choice in Synchronous Parallel Computations , 1982, ICALP.

[20]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[21]  Amir Pnueli,et al.  Permutation Graphs and Transitive Graphs , 1972, JACM.

[22]  S. Lane.  A structural characterization of planar combinatorial graphs , 1937 .

[23]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[24]  Arnold Schönhage,et al.  Storage Modification Machines , 1979, SIAM J. Comput..