-
Juris Hartmanis (July 5, 1928 – July 29, 2022) was a Latvian-born
American computer scientist and com****tional
theorist who, with
Richard E. Stearns...
-
complexity theory, the Berman–
Hartmanis conjecture is an
unsolved conjecture named after Leonard C.
Berman and
Juris Hartmanis. Informally, it
states that...
- Toms
Hartmanis (born 12
December 1987 in Liepāja,
Soviet Union), is a
Latvian ice
hockey right winger playing for the HK
Kurbads of the
Latvian Hockey...
-
Gnamptogenys hartmani is a
species of
ectaheteromorph ant
native to
South America,
Central America, Mexico, Texas, and Louisiana. "Gnamptogenys
hartmani Report"...
- model. Elgot–Robinson (1964) and more so
Hartmanis (1971)
investigate RASPs with self-modifying programs.
Hartmanis (1971)
specifies an
instruction set with...
-
Swedish Minister for
Justice and
Deputy Prime Minister of
Sweden Juris Hartmanis (1928–2022), Latvian–American
computer scientist who won the 1993 Turing...
- "cells" that can
contain any
integer (cf.
Elgot and
Robinson (1964),
Hartmanis (1971), and in
particular Cook-Rechow (1973);
references at random-access...
- (born July 5, 1936) is an
American computer scientist who, with
Juris Hartmanis,
received the 1993 ACM
Turing Award "in
recognition of
their seminal paper...
- -creative sets are
conjectured to form
counterexamples to the Berman–
Hartmanis conjecture on
isomorphism of NP-complete sets. It is NP-complete to test...
- John Nash" (PDF).
Archived (PDF) from the
original on 9
November 2018.
Hartmanis, Juris. "Gödel, von Neumann, and the P = NP problem" (PDF).
Bulletin of...
