Complete Problems Involving Boolean Labelled Structures and Projections Translations

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

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

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

[4]  Iain A. Stewart,et al.  Using the Hamiltonian Path Operator to Capture NP , 1990, J. Comput. Syst. Sci..

[5]  Neil Immerman,et al.  The complexity of iterated multiplication , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[6]  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.

[7]  Neil Immerman,et al.  Nondeterministic space is closed under complementation , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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