Skip to search formSkip to main contentSemantic Scholar
You are currently offline. Some features of the site may not work correctly.
Berman–Hartmanis conjecture
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A conjecture of Sokal (2001) regarding the domain of non-vanishing for independence polynomials of graphs, states that given any… Expand
Is this relevant?
2015
2015
This is the main paper in a sequence in which we give a complete proof of the bounded $$L^2$$L2 curvature conjecture. More… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We prove the K-theoretic Farrell-Jones conjecture with (twisted) coefficients for CAT(0)-groups.
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Advocates of ubiquitous computing have long been documenting classroom benefits of one-to-one ratios of students to handheld or… Expand
Is this relevant?
2009
2009
The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Software-engineering education programs are intended to prepare students for a field that involves rapidly changing conditions… Expand
Is this relevant?
2005
2005
Stimulated by the work of Hartmanis and Berman [5], we study the question of the existence of a tally languageL inNP such thatL… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Patient-centered care (PCC) is a popular movement among health services re- searchers, health policy analysts, and health… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Abstract K. Wagner conjectured that if G 1 , G 2 , … is any countable sequence of finite graphs, then there exist i , j with j… Expand
Is this relevant?