Berman–Hartmanis conjecture

Known as: Berman conjecture, Berman-Hartmanis conjecture 
In structural complexity theory, the Berman–Hartmanis conjecture is an unsolved conjecture named after Leonard C. Berman and Juris Hartmanis that… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2015
02419772015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
In 1977, L. Berman and J. Hartmanis [BH77] conjectured that all polynomialtime many-one complete sets for NP are are pairwise… (More)
Is this relevant?
2011
2011
This paper describes the application of the health belief model (HBM) and the vulnerable populations conceptual model (VPCM) to a… (More)
  • figure 2
  • figure 3
Is this relevant?
2010
2010
The original version of this paper appeared in Linear Algebra and its Applications, volume 430, pp.34 40, 2009. Here we correct a… (More)
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… (More)
Is this relevant?
2004
2004
We consider unlinkability of communication problem: given n users, each sending a message to some destination, encode and route… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
The relationship between grammatical and lexical development was compared in 233 English and 233 Italian children between 18 and… (More)
  • figure 1
  • figure 1
  • figure 2
  • figure 2
  • table 1
Is this relevant?
2001
2001
Normative data are described and compared for 34 Italian-speaking children (5-6 years of age) and 50 Italian-speaking adults in a… (More)
  • table 1
  • table 2
  • table 2
  • table 3
  • table 3
Is this relevant?
1995
1995
Berman and Hartmanis [1977] conjectured that there is a polynomial-time computable isomorphism between any two languages complete… (More)
Is this relevant?
1988
1988
0. Introduction We fix a finite field K of characteristic p and a finite p-group G=~g I ,...,gnU, n=p m. The group algebra K[G… (More)
Is this relevant?
1977
1977
Stimulated by the work of Hartmanis and Berman [5], we study the question of the existence of a tally languageL inNP such thatL… (More)
Is this relevant?