Sheaf cohomology is #P-hard

Journal of Symbolic Computation

Volumn 27, Issue 4, 1999, Pages 429-433

  Bach, Eric ^a  

^a University of Wisconsin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033110666     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1998.0261     Document Type: Article

References (12)

1. Bach, E. (1991a.) Realistic analysis of some randomized algorithms. J. Comput. Syst. Sci., 42, 30-53.
2. Bach, E. (1991b). Toward a theory of Pollard's Rho-Method. Inf. Comput., 90, 139-155.
3. Bayer, D. A. (1982). The Division Algorithm and the Hilbert Scheme, Dissertation, Harvard University.
4. Bayer, D., Mumford, D. (1993). What can be computed in algebraic geometry? In Eisenbud, D. and Robbiano, L., eds, Computational Algebraic Geometry and Commutative Alegbra, pp. 1-48. Cambridge, Cambridge University Press.
5. Fraenkel, A. S., Yesha, Y. (1979). Complexity of problems in games, graphs, and algebraic equations. Disc. Appl. Math., 1, 15-30.
6. Fraenkel, A. S., Yesha, Y. (1980). Complexity of solving algebraic equations. Inf. Proc. Letters, 10, 178-179.
7. Garey, M. R., Johnson, D. S. (1979). Computers and Intractability. New York, Freeman.
8. Hartshorne, R. (1977). Algebraic Geometry. Berlin, Springer-Verlag.
9. Iitaka, S. (1979). Algebraic Geometry. Berlin, Springer-Verlag.
10. Valiant, L. G. (1979a). The complexity of computing the permanent. Theor. Comput. Sci., 8, 189-201.
11. Valiant, L. G. (1979b). The complexity of enumeration and reliability problems. SIAM J. Comput., 8, 410-421.
12. Yao, A. C. (1994). Decision tree complexity and Betti numbers. Proc. 26th ACM Symposium on Theory of Computing, Montréal, pp. 615-624, New York, ACM Press.