Skip to main content
SpringerLink
Log in

Complete problems involving boolean labelled structures and projection translations

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 560))

  • 138 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. AJTAI and R. FAGIN, Reachability is harder for directed than for undirected finite graphs, J. Symbolic Logic, 55, No. 1 (1990), 113–150.

    Google Scholar 

  2. D. M. BARRINGTON, N. IMMERMAN, and H. STRAUBING, On uniformity within NC1, J. Comput. System Sci., 41 (1990), 274–306.

    Article  Google Scholar 

  3. E. DAHLHAUS, Reduction to NP-complete problems by interpretations, Lecture Notes in Computer Science 171, Springer-Verlag, Berlin (1984), 357–365.

    Google Scholar 

  4. H. B. ENDERTON, A Mathematical Introduction to Logic, Academic Press, New York (1972).

    Google Scholar 

  5. R. FAGIN, Generalized first-order spectra and polynomial-time recognizable sets, Complexity of Computation (Ed. R.Karp), SIAMAMSProc., 7 (1974), 27–41.

    Google Scholar 

  6. M. R. GAREY and D. S. JOHNSON, Computers and intractability, W.H.Freeman and Co., San Francisco (1979).

    Google Scholar 

  7. H. N. GABOW, S. N. MAHESHWARI, and L. J. OSTERWEIL, On two problems in the generation of program test paths, IEEE Trans. Soft. Eng., SE-2,3 (1976), 227–231.

    Google Scholar 

  8. J. N. HAGSTROM, Combinatoric tools for computing network reliability, Ph.D Thesis, Dept. of IEOR, Univ. California, Berkeley, 1980.

    Google Scholar 

  9. N. IMMERMAN AND S. LANDAU, The complexity of iterated multiplication, Proc. 4th Symp. on Structure in Complexity Theory, IEEE Press (1989), 104–111.

    Google Scholar 

  10. N. IMMERMAN, Languages that capture complexity classes, SIAM J. Comput, 16, 4 (1987), 760–778.

    Article  Google Scholar 

  11. N. IMMERMAN, Nondeterministic space is closed under complementation, SIAM J. Comput., 17, 5 (1988), 935–938.

    Article  Google Scholar 

  12. M. JERRUM, On the complexity of evaluating multivariate polynomials, Univ. of Edinburgh Tech. Rep. CST-11-81 (1981).

    Google Scholar 

  13. D. S. JOHNSON, The NP-completeness column: an ongoing guide, J. Algorithms, 6 (1985), 145–159.

    Article  Google Scholar 

  14. A. R. MEYER AND L. J. STOCKMEYER, The equivalence problem for regular expressions with squaring requires exponential space, Proc. 13th IEEE Symp. on Switching and Automata Theory, IEEE Press (1972), 125–129.

    Google Scholar 

  15. J. S. PROVAN and M. O. BALL, The complexity of counting cuts and computing the probability that a graph is connected, SIAM J. Comput, 12 (1983), 777–788.

    Article  Google Scholar 

  16. J. S. PROVAN, The complexity of reliability computations in planar and acyclic graphs, SIAM J. Comput., 15, 3 (1986), 694–702.

    Article  Google Scholar 

  17. L. J. STOCKMEYER AND A. R. MEYER, Word problems requiring exponential time: preliminary report, Proc. 5th ACM Symp. on Theory of Computing, ACM Press (1973), 1–9.

    Google Scholar 

  18. K. SUTNER, A. SATYANARAYANA, and C. SUFFEL, The complexity of the residual node connectedness reliability problem, SIAM J. Comput., 20, 1 (1991), 149–155

    Article  Google Scholar 

  19. I. A. STEWARR, Using the Hamiltonian path operator to capture NP, J. Comput Systems Sci., to appear (also LNCS 468).

    Google Scholar 

  20. I. A. STEWART, Comparing the expressibility of languages formed using NP-complete operators, J. Logic Computat, 1, 3 (1991), 305–330 (also LNCS 484).

    Google Scholar 

  21. I. A. STEWART, On complete problems for NP via projection translations, Proc. Computer Science Logic (CSL '91), Berne, Switzerland, Oct. 7–11, 1991, Lectures Notes in Computer Science, Springer-Verlag, Berlin, to appear.

    Google Scholar 

  22. L. J. STOCKMEYER, The polynomial-time hierarchy, Theor. Comput. Sci, 3 (1977), 1–22.

    Article  Google Scholar 

  23. L. G. VALIANT, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979), 410–421.

    Article  Google Scholar 

  24. C. WRATHALL, Complete sets and the polynomial-time hierarchy, Theor. Comput Sci., 3 (1977), 23–33.

    Article  Google Scholar 

  25. E. ZEMEL, Polynomial algorithms for estimating network reliability, Networks, 12 (1982), 439–452.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, Univ. Newcastle upon Tyne, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, England

    Iain A. Stewart

Authors
  1. Iain A. Stewart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Somenath Biswas Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stewart, I.A. (1991). Complete problems involving boolean labelled structures and projection translations. In: Biswas, S., Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1991. Lecture Notes in Computer Science, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54967-6_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-54967-6_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54967-3

  • Online ISBN: 978-3-540-46612-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation