computational complexity theory". Hartmanis was born in Latvia on July 5, 1928. He was a son of Mārtiņš Hartmanis [lv], a general in the Latvian Army...
29 KB (2,501 words) - 07:12, 13 September 2024
Latvian scientist and academic Juris Fernandez (born 1978), Filipino singer Juris Hartmanis (1928–2022), Latvian scientist Juris Kalniņš (1938–2010), Latvian...
2 KB (281 words) - 15:36, 1 January 2024
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...
25 KB (3,042 words) - 09:56, 6 October 2024
Complexity. Addison-Wesley. ISBN 0-201-53082-1. Section 20.1, page 491. Juris Hartmanis, Neil Immerman, Vivian Sewelson. "Sparse Sets in NP−P: EXPTIME versus...
7 KB (991 words) - 20:22, 3 October 2024
the ACM. 37 (11): 95–99. doi:10.1145/188280.188379. Allan Borodin. "Juris Hartmanis - A.M. Turing Award Laureate". Association for Computing Machinery...
79 KB (3,507 words) - 00:12, 29 October 2024
complexity theory, the Berman–Hartmanis conjecture is an unsolved conjecture named after Leonard C. Berman and Juris Hartmanis. Informally, it states that...
11 KB (1,234 words) - 10:59, 20 May 2024
Register machine (section Hartmanis (1971))
model. Elgot–Robinson (1964) and more so Hartmanis (1971) investigate RASPs with self-modifying programs. Hartmanis (1971) specifies an instruction set with...
54 KB (5,282 words) - 23:20, 2 October 2024
Stearns (born July 5, 1936) is an American computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award "in recognition of their seminal...
5 KB (369 words) - 07:14, 13 September 2024
multi-tape Turing machines was first proven by Richard E. Stearns and Juris Hartmanis in 1965. It was improved a year later when F. C. Hennie and Richard...
17 KB (2,467 words) - 08:18, 10 July 2024
David Coolidge, physicist Ivar Giaever, Nobel Laureate, physicist Juris Hartmanis, Turing Award winner, computer scientist[citation needed] Christopher...
10 KB (890 words) - 12:17, 5 June 2024
linguist Filips Halsmans (1906–1979) – Latvian-American photographer Juris Hartmanis (1928–2022) – computer scientist; Turing Award winner Uvis Helmanis...
21 KB (2,318 words) - 17:08, 6 September 2024
his Ph.D. from Cornell University in 1980 under the supervision of Juris Hartmanis, a Turing Award winner at Cornell. His book Descriptive Complexity...
4 KB (332 words) - 07:21, 13 September 2024
linguist Philippe Halsman (Filips Halsmans, 1906–1979), photographer Juris Hartmanis (1928–2022), computer scientist, Turing Award winner (1993) Rashida...
20 KB (1,996 words) - 03:42, 2 November 2024
former Swedish Minister for Justice and Deputy Prime Minister of Sweden Juris Hartmanis (1928–2022), Latvian–American computer scientist who won the 1993 Turing...
106 KB (9,440 words) - 16:48, 7 November 2024
Peter G. Harrison George W. Hart Peter E. Hart Vi Hart James Hartle Juris Hartmanis Robin Hartshorne Allen Hatcher Herbert A. Hauptman Jane M. Hawkins...
60 KB (5,790 words) - 21:25, 7 November 2024
program committee consisted of Michael A. Harrison, Robert W. Floyd, Juris Hartmanis, Richard M. Karp, Albert R. Meyer, and Jeffrey D. Ullman. Early seminal...
12 KB (1,162 words) - 05:39, 15 September 2024
seminal 1965 paper "On the Computational Complexity of Algorithms" by Juris Hartmanis and Richard E. Stearns, which laid out the definitions of time complexity...
49 KB (6,717 words) - 21:56, 25 September 2024
Straight), kidney failure. Margot Eskens, 82, German Schlager singer. Juris Hartmanis, 94, Latvian-American computer scientist. Mamoun Hassan, 84, Saudi-born...
217 KB (15,728 words) - 18:33, 18 September 2024
of (parallel) processors. Since the ground-breaking 1965 paper by Juris Hartmanis and Richard E. Stearns and the 1979 book by Michael Garey and David...
3 KB (304 words) - 01:05, 13 December 2020
Teofisto Guingona Jr., 13th Vice President of the Philippines July 5 Juris Hartmanis, Latvian-born American computer scientist, computational theorist (d...
132 KB (12,194 words) - 03:50, 18 October 2024
Doctor of Philosophy degree (Computer Science) under the supervision of Juris Hartmanis, from Cornell University in 1985. His post-doctoral research was conducted...
7 KB (511 words) - 19:40, 13 September 2024
University, completing a doctorate in 1969 under the supervision of Juris Hartmanis. He joined the Toronto faculty in 1969 and was promoted to full professor...
6 KB (465 words) - 07:31, 13 September 2024
1977 Alfred W. Hales, BS 1960, PhD 1962 Philip J. Hanlon, PhD 1981 Juris Hartmanis, PhD 1955; recipient of the 1993 Turing Award Chandrashekhar Khare...
117 KB (14,265 words) - 11:18, 8 October 2024
graph thus encoded is NEXPTIME-complete. Game complexity NP EXPTIME Juris Hartmanis, Neil Immerman, Vivian Sewelson. Sparse Sets in NP-P: EXPTIME versus...
6 KB (934 words) - 19:45, 10 October 2024
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...
4 KB (595 words) - 09:15, 9 February 2024
computer science in 1977 from Cornell University, where he was advised by Juris Hartmanis on the thesis, Complexity of Finitely Presented Algebras. He is known...
11 KB (792 words) - 00:19, 27 October 2024
Discipline Computer science Language English Edited by Gerard Goos, Juris Hartmanis Publication details History 1973–present Publisher Springer Science+Business...
2 KB (97 words) - 05:54, 12 April 2024
1145/74074.74089. S2CID 33850327. Juris Hartmanis (1989), “Overview of computational Complexity Theory” in J. Hartmanis (ed.), Computational Complexity...
37 KB (7,078 words) - 04:17, 13 October 2024
Co. ISBN 0-7167-1045-5. MR 0519066. 338 pages. Copy at archive.org Juris Hartmanis (1982). "Computers and Intractability: A Guide to the Theory of NP-Completeness...
7 KB (779 words) - 07:12, 8 May 2023
computed in polynomial time. It was formulated by Leonard C. Berman and Juris Hartmanis in 1977, based on the observation that all NP-complete sets known at...
12 KB (1,742 words) - 00:02, 18 September 2024