In structural complexity theory, the Berman–Hartmanis conjecture is an unsolved

conjecture In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis or Fermat's conjecture (now a theorem, proven in 1995 by Andrew Wiles), ha ...

named after Leonard C. Berman and

Juris Hartmanis Juris Hartmanis (July 5, 1928 – July 29, 2022) was a Latvian-born American computer scientist and computational theorist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established ...

.. Informally, it states that all

NP-complete In computational complexity theory, NP-complete problems are the hardest of the problems to which ''solutions'' can be verified ''quickly''. Somewhat more precisely, a problem is NP-complete when: # It is a decision problem, meaning that for any ...

languages look alike, in the sense that they can be related to each other by

polynomial time In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations p ...

isomorphism In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...

Statements

Statement using p-isomorphism

An isomorphism between

formal language In logic, mathematics, computer science, and linguistics, a formal language is a set of strings whose symbols are taken from a set called "alphabet". The alphabet of a formal language consists of symbols that concatenate into strings (also c ...

s ''L''₁ and ''L''₂ is a

bijective In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equival ...

map ''f'' from

string String or strings may refer to: *String (structure), a long flexible structure made from threads twisted together, which is used to tie, bind, or hang other objects Arts, entertainment, and media Films * ''Strings'' (1991 film), a Canadian anim ...

s in the alphabet of ''L''₁ to strings in the alphabet of ''L''₂, with the property that a string ''x'' belongs to ''L''₁ if and only if ''f''(''x'') belongs to ''L''₂. A polynomial-time isomorphism, or ''p''-isomorphism for short, is an isomorphism ''f'' where both ''f'' and its

inverse function In mathematics, the inverse function of a function (also called the inverse of ) is a function that undoes the operation of . The inverse of exists if and only if is bijective, and if it exists, is denoted by f^ . For a function f\colon ...

can be computed in an amount of time polynomial in the lengths of their arguments. Berman and Hartmanis conjectured that all NP-complete languages are p-isomorphic to each other.

Statement using paddable languages

A formal language ''L'' is paddable if there is a polynomial time function ''f''(''x'',''y''), with a polynomial time inverse, such that for every ''x'' and every ''y'', the string ''x'' belongs to ''L'' if and only if ''f''(''x'',''y'') belongs to ''L''. That is, it is possible to pad the input ''x'' with irrelevant information ''y'', in an invertible way, without changing its membership in the language. Berman and Hartmanis ''proved'' that all pairs of paddable NP-complete languages are p-isomorphic. Since ''p''-isomorphism preserves paddability, and there exist paddable NP-complete languages, an equivalent way of stating the Berman–Hartmanis conjecture is that all NP-complete languages are paddable.

Statement using equivalence relations

Polynomial time isomorphism is an

equivalence relation In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equ ...

, and it can be used to partition the formal languages into

equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements ...

es, so another way of stating the Berman–Hartmanis conjecture is that the NP-complete languages form a single equivalence class for this relation.

Implications

Non-existence of sparse NP-complete languages

A formal language is called sparse if the number of yes-instances of length ''n'' grows only polynomially as a function of ''n''. The known NP-complete languages have a number of yes-instances that grows exponentially, and if ''L'' is a language with exponentially many yes-instances then it cannot be ''p''-isomorphic to a sparse language, because its yes-instances would have to be mapped to strings that are more than polynomially long in order for the mapping to be one-to-one. Therefore, if the Berman–Hartmanis conjecture is true, an immediate consequence would be the nonexistence of sparse NP-complete languages.

P vs. NP

The nonexistence of sparse NP-complete languages in turn implies that

P ≠ NP The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved. Here, "quickly" means an algorithm exists that ...

, because if P = NP then every nontrivial language in P (including some sparse ones, such as the language of binary strings all of whose bits are zero) would be NP-complete. In 1982, Steve Mahaney published his proof that the nonexistence of sparse NP-complete languages (with NP-completeness defined in the standard way using

many-one reduction In computability theory and computational complexity theory, a many-one reduction (also called mapping reduction) is a reduction that converts instances of one decision problem (whether an instance is in L_1) to another decision problem (whether ...

s) is in fact equivalent to the statement that P ≠ NP; this is

Mahaney's theorem Mahaney's theorem is a theorem in computational complexity theory proven by Stephen Mahaney that states that if any sparse language is NP-complete, then P = NP. Also, if any sparse language is NP-complete with respect to Turing reductions, then the ...

. Even for a relaxed definition of NP-completeness using

Turing reduction In computability theory, a Turing reduction from a decision problem A to a decision problem B is an oracle machine that decides problem A given an oracle for B (Rogers 1967, Soare 1987) in finitely many steps. It can be understood as an algorithm ...

s, the existence of a sparse NP-complete language would imply an unexpected collapse of the

polynomial hierarchy In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize the classes NP and co-NP. Each class in the hierarchy is contained within PSPACE. ...

Evidence

As evidence towards the conjecture, showed that an analogous conjecture with a restricted type of reduction is true: every two languages that are complete for NP under AC⁰ many-one reductions have an AC⁰ isomorphism. showed that, if there exist

one-way function In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, s ...

s that cannot be inverted in polynomial time on all inputs, but if every such function has a small but dense subset of inputs on which it can be inverted in

P/poly In computational complexity theory, P/poly is a complexity class that can be defined in both circuit complexity and non-uniform complexity. Since the two definitions are equivalent, this concept bridges the two areas. In the perspective of circui ...

(as is true for known functions of this type) then every two NP-complete languages have a P/poly isomorphism. And found an

oracle machine In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a black box, called an oracle, which is able to solve certain problems in a single operation. The ...

model in which the analogue to the isomorphism conjecture is true. Evidence against the conjecture was provided by and . Joseph and Young introduced a class of NP-complete problems, the ''k''-creative sets, for which no ''p''-isomorphism to the standard NP-complete problems is known. Kurtz et al. showed that in oracle machine models given access to a

random oracle In cryptography, a random oracle is an oracle (a theoretical black box) that responds to every ''unique query'' with a (truly) random response chosen uniformly from its output domain. If a query is repeated, it responds the same way every tim ...

, the analogue of the conjecture is not true: if ''A'' is a random oracle, then not all sets complete for NP^''A'' have isomorphisms in P^''A''. Random oracles are commonly used in the theory of cryptography to model

cryptographic hash function A cryptographic hash function (CHF) is a hash algorithm (a map (mathematics), map of an arbitrary binary string to a binary string with a fixed size of n bits) that has special properties desirable for a cryptography, cryptographic application: ...

s that are computationally indistinguishable from random, and the construction of Kurtz et al. can be carried out with such a function in place of the oracle. For this reason, among others, the Berman–Hartmanis isomorphism conjecture is believed false by many complexity theorists..

References

{{DEFAULTSORT:Berman-Hartmanis conjecture Structural complexity theory Conjectures Unsolved problems in computer science