Diophantine complexity

@article{Adleman1976DiophantineC,
  title={Diophantine complexity},
  author={Leonard M. Adleman and Kenneth L. Manders},
  journal={17th Annual Symposium on Foundations of Computer Science (sfcs 1976)},
  year={1976},
  pages={81-88}
}
In the 1930's Gode1 together with Church, K1eene, and Turing established a relationship between computation and elementary number theory. Using techniques developed by Robinson, Putnam, Davis4 and Matijasevic7 in th~ir celebrated solution to Hilbert's 10th problem, we began in [2] a detai led analysis to determine what consequences this relationship might have for computational complexity. We found that there were consequences not only for computational complexity (nontrivial lower bounds on… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

New Proof of the Theorem on Exponential Diophantine Representation of .Recursively Enumerable Predicates,

Y. IIA
Zapiskiof The Mathematical Institute of Lenningrade Devision of Academy of Sciences USSR, • 1976

Number Theoretic Aspects of Computational Complexity.

L. lJ Adleman
Ph.D. Thesis, U.C. Berkeley, • 1976

1lReduction of an Arbitrary Diophantine Equation to One in 13 Unknowns,H

Y. Matijasevic, J. Robinson
Acta Arithmetica27 • 1975

Hilbert's Tenth Problem is Unso1vab1e,

M. Davis
Amer. Math. Monthly • 1973

Sets Are Diophantine (Russian)," Dok1

Enumerable
Akad. Nauk SSSR • 1970

liThe Decision Problem for Exponential Diophantine Equations,

M. 4J Davis, H. Putnam, J. Robinson
Annals of Math • 1961

, 1 lReduction of an Arbitrary Diophantine Equation to One in 13 Unknowns

Y. Matijasevic, J. Robinson
-1

IIA New Proof of the Theorem on Exponential Diophantine Representation of

Y. Matijasevic
Recur - sively Enumerable Predicates , " Zapiskiof The Mathematical Institute of Lenningrade Devision of Academy of Sciences

Similar Papers

Loading similar papers…