complexity theory, the Berman–Hartmanis conjecture is an unsolved conjecture named after Leonard C. Berman and Juris Hartmanis. Informally, it states...

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...

k {\displaystyle k} -creative sets are conjectured to form counterexamples to the Berman–Hartmanis conjecture on isomorphism of NP-complete sets. It is...

transformed input, have also been considered. A version of the Berman–Hartmanis conjecture for PSPACE-complete sets states that all such sets look alike...

input, and used these reductions to prove an analogue of the Berman–Hartmanis conjecture stating that all NP-complete sets are polynomial-time isomorphic...

its input is paired, and return the other element of the pair. Berman–Hartmanis conjecture, an analogous statement in computational complexity theory. Odifreddi...

S. R. Mahaney. Sparse complete sets for NP: Solution of a conjecture by Berman and Hartmanis. Journal of Computer and System Sciences 25:130-143. 1982...

theory, and used it to provide potential counterexamples to the Berman–Hartmanis conjecture on isomorphism of NP-complete sets. Soare (1987); Rogers (1987)...

S. R. Mahaney. Sparse complete sets for NP: Solution of a conjecture by Berman and Hartmanis. Journal of Computer and System Sciences 25:130–143. 1982...

(October 1982). "Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis". Journal of Computer and System Sciences. 25 (2): 130–143...

k-creative sets, which form a potential counterexample to the Berman–Hartmanis conjecture. Hopcroft, John; Joseph, Deborah; Whitesides, Sue (1985), "On...

Prize (1997), member of the National Academy of Engineering (2019) Juris Hartmanis (Professor Emeritus, Computer Science) - Turing Award recipient, 1993;...