Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Incompressibility method

The incompressibility method is a proof method such as the probabilistic method, the counting method, or the pigeonhole principle. The method… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
The saturation properties of neutron-rich matter are investigated in a relativistic mean-field formalism using two accurately… Expand
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
2004
2004
We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average… Expand
2004
2004
Symmetry energy terms from macroscopic mass formulae are investigated as generalized polarizabilities of nuclear matter. Besides… Expand
  • figure 5
2002
2002
Conducting experimental investigations for recognition of concrete dams behavior under dynamic loads e.g. earthquakes or natural… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 4
2000
2000
Abstract The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas… Expand
2000
2000
We demonstrate an Ω(<italic>pn</italic><supscrpt>1+1/<italic>p </italic>) lower bound on the average-case running time (uniform… Expand
1999
1999
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it… Expand
1999
1999
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov… Expand
1999
1999
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it… Expand
1962
1962
IN a paper to be published elsewhere, I have derived the ormula: where η is a measure of departure from chemical homogeneity at… Expand