Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Berman–Hartmanis_conjecture> ?p ?o }
Showing triples 1 to 50 of
50
with 100 triples 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 wikiPageLength "10362".
- Berman–Hartmanis_conjecture wikiPageOutDegree "28".
- Berman–Hartmanis_conjecture wikiPageRevisionID "687526363".
- Berman–Hartmanis_conjecture wikiPageWikiLink AC0.
- Berman–Hartmanis_conjecture wikiPageWikiLink Bijection.
- Berman–Hartmanis_conjecture wikiPageWikiLink Category:Conjectures.
- Berman–Hartmanis_conjecture wikiPageWikiLink Category:Structural_complexity_theory.
- Berman–Hartmanis_conjecture wikiPageWikiLink Conjecture.
- Berman–Hartmanis_conjecture wikiPageWikiLink Cryptographic_hash_function.
- Berman–Hartmanis_conjecture wikiPageWikiLink Equivalence_class.
- Berman–Hartmanis_conjecture wikiPageWikiLink Equivalence_relation.
- Berman–Hartmanis_conjecture wikiPageWikiLink Formal_language.
- Berman–Hartmanis_conjecture wikiPageWikiLink Inverse_function.
- Berman–Hartmanis_conjecture wikiPageWikiLink Isomorphism.
- Berman–Hartmanis_conjecture wikiPageWikiLink Juris_Hartmanis.
- Berman–Hartmanis_conjecture wikiPageWikiLink Mahaneys_theorem.
- Berman–Hartmanis_conjecture wikiPageWikiLink Many-one_reduction.
- Berman–Hartmanis_conjecture wikiPageWikiLink Myhill_isomorphism_theorem.
- Berman–Hartmanis_conjecture wikiPageWikiLink NP-completeness.
- Berman–Hartmanis_conjecture wikiPageWikiLink One-way_function.
- Berman–Hartmanis_conjecture wikiPageWikiLink Oracle_machine.
- Berman–Hartmanis_conjecture wikiPageWikiLink poly.
- Berman–Hartmanis_conjecture wikiPageWikiLink P_versus_NP_problem.
- Berman–Hartmanis_conjecture wikiPageWikiLink Padding_argument.
- Berman–Hartmanis_conjecture wikiPageWikiLink Polynomial_hierarchy.
- Berman–Hartmanis_conjecture wikiPageWikiLink Random_oracle.
- Berman–Hartmanis_conjecture wikiPageWikiLink Sparse_language.
- Berman–Hartmanis_conjecture wikiPageWikiLink String_(computer_science).
- Berman–Hartmanis_conjecture wikiPageWikiLink Structural_complexity_theory.
- Berman–Hartmanis_conjecture wikiPageWikiLink Time_complexity.
- Berman–Hartmanis_conjecture wikiPageWikiLink Turing_reduction.
- Berman–Hartmanis_conjecture wikiPageWikiLinkText "Berman–Hartmanis conjecture".
- Berman–Hartmanis_conjecture wikiPageUsesTemplate Template:Harvtxt.
- Berman–Hartmanis_conjecture wikiPageUsesTemplate Template:Reflist.
- Berman–Hartmanis_conjecture wikiPageUsesTemplate Template:Unsolved.
- Berman–Hartmanis_conjecture subject Category:Conjectures.
- Berman–Hartmanis_conjecture subject Category:Structural_complexity_theory.
- Berman–Hartmanis_conjecture hypernym Conjecture.
- Berman–Hartmanis_conjecture type Conjecture.
- Berman–Hartmanis_conjecture type Statement.
- Berman–Hartmanis_conjecture type Statement.
- 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 Q4892564.
- Berman–Hartmanis_conjecture sameAs m.0j458yb.
- Berman–Hartmanis_conjecture sameAs Q4892564.
- Berman–Hartmanis_conjecture wasDerivedFrom Berman–Hartmanis_conjecture?oldid=687526363.
- Berman–Hartmanis_conjecture isPrimaryTopicOf Berman–Hartmanis_conjecture.