Computational complexity of decision procedures for polynomials
- 1 October 1975
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 169-177
- https://doi.org/10.1109/sfcs.1975.9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Diophantine Representation of the Set of Prime NumbersThe American Mathematical Monthly, 1976
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975
- Refinements of the nondeterministic time and space hierarchiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Linear forms in the logarithms of algebraic numbersMathematika, 1966
- The Decision Problem for Exponential Diophantine EquationsAnnals of Mathematics, 1961