Complete Problems Involving Boolean Labelled Structures and Projection Transactions

We show that the classes of the polynomial hierarchy have complete problems via projection translations (without successor) and we exhibit some new, natural complete problems for the complexity classes co-NP and IIJ via projection translations: these problems were not even known to be complete for co-NP and IIJ via polynomial-time reductions. Most of the problems involve the reliability of networks of processors where the links may fail and where these failures may be related to one another in a restricted way, but we show how our trick of labelling discrete structures with Boolean literals can be applied to yield other new natural complete problems involving digraphs and Boolean formulae. We also show that it is unlikely that certain problems (known to be complete for the respective complexity class via projection translations) are complete for L, NL, and NP via monotone projection translations; for if any of them are then L = NP, NL = NP, or NP = co-NP.

[1]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[2]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[3]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[6]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[7]  Klaus Sutner,et al.  The Complexity of the Residual Node Connectedness Reliability Problem , 1991, SIAM J. Comput..

[8]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[9]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[10]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[11]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[12]  Mark Jerrum,et al.  On the complexity of evaluating multivariate polynomials , 1981 .

[13]  Ronald Fagin,et al.  Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[14]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[15]  Iain A. Stewart,et al.  Comparing the Expressibility of Languages Formed using NP-Complete Operators , 1991, J. Log. Comput..

[16]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[17]  J. N. Hagstrom.  Combinatoric tools for computing network reliability , 1980 .

[18]  Eitan Zemel,et al.  Polynomial algorithms for estimating network reliability , 1982, Networks.

[19]  Leon J. Osterweil,et al.  On Two Problems in the Generation of Program Test Paths , 1976, IEEE Transactions on Software Engineering.

[20]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[21]  Elias Dahlhaus,et al.  Reduction to NP-complete problems by interpretations , 1983, Logic and Machines.

[22]  J. Scott Provan,et al.  The Complexity of Reliability Computations in Planar and Acyclic Graphs , 1986, SIAM J. Comput..