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

Related topics

Related topics

8 relations
Comparison sortDirected graphHeapsortIncompressible string
Expand

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Incompressibility of neutron-rich matter
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
Is this relevant?
2004
2004
Enrichment of enhanced assumed strain approximations for representing strong discontinuities: addressing volumetric incompressibility and the discontinuous patch test
SUMMARY We present a geometrically nonlinear assumed strain method that allows for the presence of arbitrary, intra-finite… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
New applications of the incompressibility method: Part II
Abstract The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas… Expand
Is this relevant?
1999
1999
Kolmogorov Random Graphs and the Incompressibility Method
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov… Expand
Is this relevant?
1999
1999
New Applications of the Incompressibility Method
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it… Expand
Is this relevant?
1999
1999
New Applications of the Incompressibility Method
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it… Expand
Is this relevant?
1999
1999
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information… Expand
  • table 1.1
  • figure 4.1
Is this relevant?
1994
1994
Light scattering by aqueous protein solutions that exhibit liquid-liquid phase separation
We report our use of static and dynamic light scattering techniques to study aqueous solutions of the bovine eye-lens specific… Expand
  • figure 1-1
  • figure 21
  • table 22
  • figure 31
  • figure 32
Is this relevant?
1977
1977
General relativistic incompressibility
 
Is this relevant?
1962
1962
Earth's Central Density
IN a paper to be published elsewhere, I have derived the ormula: where η is a measure of departure from chemical homogeneity at… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE