Completeness for parity problems

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 1-8

  Valiant, Leslie G ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HAMILTONIANS; LINEAR ALGEBRA; THEOREM PROVING; ALGEBRA; COMBINATORIAL MATHEMATICS;

BQP; COMPLEXITY CLASSES; HAMILTONIAN CIRCUITS; PARITY CLASSES; BOOLEAN FORMULAE; COMPLETE PROBLEMS; COMPLEXITY CLASS; COUNTING PROBLEMS; EXISTENCE OF SOLUTIONS; HOLOGRAPHIC ALGORITHMS; PARITY PROBLEMS;

PROBLEM SOLVING; BOOLEAN ALGEBRA;

EID: 26844524682     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_1     Document Type: Conference Paper

References (18)

1. [AK02] V. Arvind and P.P. Kurur. Graph isomorphism is in SPP. Electronic Colloquium on Computational Complexity, Report 37, 2002.
2. [BBF98] R. Beigel, H. Buhrman, and L. Fortnow. NP might not be as easy as detecting single solutions, STOC98, ACM Press, pp.203-208 (1998).
3. [C71] S.A. Cook, The complexity of theorem proving procedures, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971), pp. 151-158.
4. [CB05] M. Cook, and J. Bruck, Implementability among predicates. Technical Report. California Institute of Technology, Pasadena, CA (2005).
5. [CH90] J.-Y. Cai and L. A. Hemachandra. On the power of parity polynomial time. Math. Syst. Theory. 23:2 (1990) 95-106.
6. [GJT76] M. R. Garey, D. S. Johnson and R. E. Tarjan, The Planar Hamiltonian Circuit Problem is NP-Complete, SIAM J. Computing, 5 (1976), pp. 704-714.
7. [GP86] L.M. Goldschlager and I. Parberry. On the construction of parallel computers from various bases of Boolean functions. Theoretical Computer Science, 43 (1986) 43-58.
8. [HS90] H. B. Hunt III and R. E. Stearns. The complexity of very simple Boolean formulas with applications. SIAM J. Comput., 19:1 (1990) 44-70.
9. [LOT03] M. Liskiewicz, M. Ogihara, and S. Toda, The Complexity of Counting Self-avoiding Walks in Subgraphs of Two-dimensional Grids and Hypercubes, Theoretical Computer Science, 304 (2003), 129-156
10. [PZ83] C. H. Papadimitriou, and S. Zachos. Two remarks on the power of counting. Theoretical Computer Science, (1983) 269-276.
11. [T1880] P.G. Tait, Remarks on coloring of maps. Proc. Royal Soc. Edinburgh 10 (1880) 729.
12. [TO92] S. Toda and M. Ogiwara, Counting classes are at least as hard as the polynomial time hierarchy. SIAM J. Comput., 21:2 (1992) 316-328.
13. [T46] W. T. Tutte, On Hamiltonian circuits, J. London Math. Soc. 21, (1946), pp. 98-101.
14. [V79] L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8 (1979) 189-201.
15. [V02] L. G. Valiant, Quantum circuits that can be simulated classically in polynomial time, SIAM J. on Computing, 31:4 (2002) 1229-1254.
16. [V04] L. G. Valiant, Holographic algorithms, Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, Oct 17-19, (2004). IEEE Press, 306-315.
17. [V05] L. G. Valiant, Holographic circuits, Proc. 32nd ICALP, LNCS, Springer, (2005), to appear.
18. [VV86] L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85-93, 1986.