Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2005: Computing and Combinatorics pp 1–8Cite as

Completeness for Parity Problems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3595))

Abstract

In this talk we shall review recent work on holographic algorithms and circuits. This work can be interpreted as offering formulations of the question of whether computations within such complexity classes as NP, ⊕P, BQP, or #P, can be efficiently computed classically using linear algebra. The central part of the theory is the consideration of gadgets that map simple combinatorial constraints into gates, assemblies of which can be evaluated efficiently using linear algebra. The combinatorial constraints that appear most fruitful to investigate are the simplest ones that correspond to problems complete in these complexity classes. With this motivation we shall in this note consider the parity class ⊕P for which our understanding of complete problems is particularly limited. For example, among the numerous search problems for which the existence of solutions can be determined in P and the counting problem is known to be #P-complete, the #P-completeness proof does not generally translate to a ⊕P-completeness proof. We observe that in one case it does, and enumerate several natural problems for which the complexity of parity is currently unresolved. We go on to consider two examples of NP-complete problems for which ⊕P-completeness can be proved but is not immediate: Hamiltonian circuits for planar degree three graphs, and satisfiability of read-twice Boolean formulae.

This research was supported in part by grants NSF-CCR-03-10882, NSF-CCR-98-77049, and NSF-CCF-04-27129.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. Electronic Colloquium on Computational Complexity, Report 37 (2002)

    Google Scholar 

  2. Beigel, R., Buhrman, H., Fortnow, L.: NP might not be as easy as detecting single solutions. In: STOC 1998, pp. 203–208. ACM Press, New York (1998)

    Google Scholar 

  3. Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)

    Google Scholar 

  4. Cook, M., Bruck, J.: Implementability among predicates. Technical Report. California Institute of Technology, Pasadena, CA (2005)

    Google Scholar 

  5. Cai, J.-Y., Hemachandra, L.A.: On the power of parity polynomial time. Math. Syst. Theory 23(2), 95–106 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Garey, M.R., Johnson, D.S., Tarjan, R.E.: The Planar Hamiltonian Circuit Problem is NP-Complete. SIAM J. Computing 5, 704–714 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Goldschlager, L.M., Parberry, I.: On the construction of parallel computers from various bases of Boolean functions. Theoretical Computer Science 43, 43–58 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hunt III, H.B., Stearns, R.E.: The complexity of very simple Boolean formulas with applications. SIAM J. Comput. 19(1), 44–70 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Liskiewicz, M., Ogihara, M., Toda, S.: The Complexity of Counting Self-avoiding Walks in Subgraphs of Two-dimensional Grids and Hypercubes. Theoretical Computer Science 304, 129–156 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Papadimitriou, C.H., Zachos, S.: Two remarks on the power of counting. Theoretical Computer Science, 269–276 (1983)

    Google Scholar 

  11. Tait, P.G.: Remarks on coloring of maps. Proc. Royal Soc. Edinburgh 10, 729 (1880)

    MATH  Google Scholar 

  12. Toda, S., Ogiwara, M.: Counting classes are at least as hard as the polynomial time hierarchy. SIAM J. Comput. 21(2), 316–328 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Tutte, W.T.: On Hamiltonian circuits. J. London Math. Soc. 21, 98–101 (1946)

    Article  MathSciNet  MATH  Google Scholar 

  14. Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8, 189–201 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  15. Valiant, L.G.: Quantum circuits that can be simulated classically in polynomial time. SIAM J. on Computing 31(4), 1229–1254 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Valiant, L.G.: Holographic algorithms. In: Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, October 17-19, pp. 306–315. IEEE Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  17. Valiant, L.G.: Holographic circuits. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1–15. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theoretical Computer Science 47, 85–93 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA, 02138, USA

    Leslie G. Valiant

Authors
  1. Leslie G. Valiant
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valiant, L.G. (2005). Completeness for Parity Problems. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_1

Download citation

  • DOI: https://doi.org/10.1007/11533719_1

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31806-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation