Skip to search formSkip to main contentSkip to account menu

Incompressibility method

The incompressibility method is a proof method such as the probabilistic method, the counting method, or the pigeonhole principle. The method… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
The saturation properties of neutron-rich matter are investigated in a relativistic mean-field formalism using two accurately… 
Review
2006
Review
2006
Abstract.Accurate assessment of the value of the incompressibility coefficient, K, of symmetric nuclear matter, which is directly… 
Highly Cited
2004
Highly Cited
2004
We present a geometrically non‐linear assumed strain method that allows for the presence of arbitrary, intra‐finite element… 
2004
2004
We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average… 
2002
2002
As a main result we estimate the lower bound for the number of faulty/correct components in the unreliable complex systems with… 
1999
1999
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it… 
1999
1999
We demonstrate an Ω(pn1+1/p ) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is… 
1994
1994
We report our use of static and dynamic light scattering techniques to study aqueous solutions of the bovine eye-lens specific… 
1976
1976
SIXTY years ago, Schwarzschild1 developed what he, and others through the years, regarded as the general relativistic solution… 
1962
1962
IN a paper to be published elsewhere, I have derived the ormula: where η is a measure of departure from chemical homogeneity at…