Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Berman–Hartmanis_conjecture> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items per page.
- Berman–Hartmanis_conjecture abstract "In structural complexity theory, the Berman–Hartmanis conjecture is an unsolved conjecture named after Leonard C. Berman and Juris Hartmanis that states that all NP-complete languages look alike, in the sense that they can be related to each other by polynomial time isomorphisms.".
- Berman–Hartmanis_conjecture wikiPageID "34917820".
- Berman–Hartmanis_conjecture wikiPageRevisionID "592332264".
- Berman–Hartmanis_conjecture subject Category:Conjectures.
- Berman–Hartmanis_conjecture subject Category:Structural_complexity_theory.
- Berman–Hartmanis_conjecture comment "In structural complexity theory, the Berman–Hartmanis conjecture is an unsolved conjecture named after Leonard C. Berman and Juris Hartmanis that states that all NP-complete languages look alike, in the sense that they can be related to each other by polynomial time isomorphisms.".
- Berman–Hartmanis_conjecture label "Berman–Hartmanis conjecture".
- Berman–Hartmanis_conjecture sameAs Berman%E2%80%93Hartmanis_conjecture.
- Berman–Hartmanis_conjecture sameAs Q4892564.
- Berman–Hartmanis_conjecture sameAs Q4892564.
- Berman–Hartmanis_conjecture wasDerivedFrom Berman–Hartmanis_conjecture?oldid=592332264.