Find link

language:

Find link is a tool written by Edward Betts.

searching for Juris Hartmanis 7 found (48 total)

NEXPTIME (934 words) [view diff] exact match in snippet view article find links to article

graph thus encoded is NEXPTIME-complete. Game complexity NP EXPTIME Juris Hartmanis, Neil Immerman, Vivian Sewelson. Sparse Sets in NP-P: EXPTIME versus

Sparse language (595 words) [view diff] exact match in snippet view article find links to article

Structural Complexity II. Springer. pp. 130–131. ISBN 3-540-52079-1. Juris Hartmanis, Neil Immerman, Vivian Sewelson. Sparse Sets in NP-P: EXPTIME versus

Lecture Notes in Computer Science (97 words) [view diff] exact match in snippet view article find links to article

Discipline Computer science Language English Edited by Gerard Goos, Juris Hartmanis Publication details History 1973–present Publisher Springer Science+Business

GE Aerospace Research (890 words) [view diff] exact match in snippet view article find links to article

David Coolidge, physicist Ivar Giaever, Nobel Laureate, physicist Juris Hartmanis, Turing Award winner, computer scientist[citation needed] Christopher

Conjecture (3,042 words) [view diff] exact match in snippet view article find links to article

Archived from the original (PDF) on 2015-12-22. Retrieved 2019-11-12. Juris Hartmanis 1989, Gödel, von Neumann, and the P = NP problem, Bulletin of the European

Effective dimension (1,956 words) [view diff] exact match in snippet view article find links to article

arXiv:cs/0211025. doi:10.1137/s0097539703446912. S2CID 27038. Jin-yi Cai; Juris Hartmanis (1994). "On Hausdorff and Topological Dimensions of the Kolmogorov

Logic of graphs (5,029 words) [view diff] exact match in snippet view article find links to article

Selman, Alan L. (ed.), Complexity Theory Retrospective: In honor of Juris Hartmanis on the occasion of his sixtieth birthday, New York: Springer-Verlag