Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,148,153 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Comparison sort
Directed graph
Heapsort
Incompressible string
Expand
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Incompressibility of neutron-rich matter
J. Piekarewicz
,
M. Centelles
2008
Corpus ID: 45550327
The saturation properties of neutron-rich matter are investigated in a relativistic mean-field formalism using two accurately…
Expand
Review
2006
Review
2006
Deducing the nuclear-matter incompressibility coefficient from data on isoscalar compression modes
S. Shlomo
,
V. Kolomietz
,
G. Colò
2006
Corpus ID: 32038981
Abstract.Accurate assessment of the value of the incompressibility coefficient, K, of symmetric nuclear matter, which is directly…
Expand
Highly Cited
2004
Highly Cited
2004
Enrichment of enhanced assumed strain approximations for representing strong discontinuities: addressing volumetric incompressibility and the discontinuous patch test
J. Dolbow
,
A. Devan
2004
Corpus ID: 11322150
We present a geometrically non‐linear assumed strain method that allows for the presence of arbitrary, intra‐finite element…
Expand
2004
2004
Individual Communication Complexity: Extended Abstract
H. Buhrman
,
H. Klauck
,
N. Vereshchagin
,
P. Vitányi
Symposium on Theoretical Aspects of Computer…
2004
Corpus ID: 12555832
We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average…
Expand
2002
2002
UNRELIABLE ENGINEERING SYSTEMS AND KOLMOGOROV COMPLEXITY
Martin Nehéz
,
Ján Gaso
2002
Corpus ID: 18792278
As a main result we estimate the lower bound for the number of faulty/correct components in the unreliable complex systems with…
Expand
1999
1999
New Applications of the Incompressibility Method
Tao Jiang
,
Ming Li
,
P. Vitányi
Computer/law journal
1999
Corpus ID: 1702188
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it…
Expand
1999
1999
A lower bound on the average-case complexity of shellsort
Tao Jiang
,
Ming Li
,
P. Vitányi
Journal of the ACM
1999
Corpus ID: 3265123
We demonstrate an Ω(pn1+1/p ) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is…
Expand
1994
1994
Light scattering by aqueous protein solutions that exhibit liquid-liquid phase separation
B. Fine
1994
Corpus ID: 93558700
We report our use of static and dynamic light scattering techniques to study aqueous solutions of the bovine eye-lens specific…
Expand
1976
1976
General relativistic incompressibility
F. Cooperstock
,
R. Sarracino
Nature
1976
Corpus ID: 4164860
SIXTY years ago, Schwarzschild1 developed what he, and others through the years, regarded as the general relativistic solution…
Expand
1962
1962
Earth's Central Density
K. Bullen
Nature
1962
Corpus ID: 4221337
IN a paper to be published elsewhere, I have derived the ormula: where η is a measure of departure from chemical homogeneity at…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE