Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,302,083 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.
Review
2014
Review
2014
Recent Trends in Analysis of Algorithms and Complexity Theory Performance Analysis of Bubble Sort and Insertion Sort With Computational Complexity
Mishra Sambit Kumar
,
Patnaik Dulu
,
Mishra Bibhuti Bhusan
2014
Corpus ID: 63157836
The complexity of a problem, algorithm or structure, and to obtain bounds for complexity arises in computer science. The…
Expand
2006
2006
Natural Halting Probabilities , Partial Randomness , and Zeta Functions
Marcus Hutter
,
W. Merkle
,
P. Vitányi
2006
Corpus ID: 907590
From 29.01.06 to 03.02.06, the Dagstuhl Seminar 06051 “Kolmogorov Complexity and Applications” was held in the International…
Expand
2002
2002
EVALUATION OF DISCREPANCIES BETWEEN THE DYNAMIC CHARACTERISTICS OF MATHEMATICAL AND PROTOTYPE MODELS OF CONCRETE ARCH DAM
M. Mivehchi
,
M. Ahmadi
2002
Corpus ID: 133601072
Conducting experimental investigations for recognition of concrete dams behavior under dynamic loads e.g. earthquakes or natural…
Expand
1999
1999
Status of nuclear matter incompressibility coefficient
Shalom Shlomo Cyclotron
1999
Corpus ID: 14609916
The nuclear matter (N = Z and no Coulomb interaction) equation of state (EOS), E = E(ρ), is a basic physical quantity which is…
Expand
1999
1999
New applications of the incompressibility method (extended abstract)
H. Buhrman
,
T. Jiang
,
Ming Li
,
P. Vitányi
1999
Corpus ID: 178768558
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it…
Expand
1999
1999
Some Examples of Average-case Analysis by the Imcompressibility Method
Tao Jiang
,
Ming Li
,
P. Vitányi
Jewels are Forever
1999
Corpus ID: 2106009
The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas…
Expand
Review
1997
Review
1997
Kolmogorov Incompressibility Method in Formal Proofs - A Critical Survey
V. Megalooikonomou
1997
Corpus ID: 5656065
We compare the incompressibility method of Kolmogorov complexity that is used in formal proofs of mathematical and computational…
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
1977
1977
General relativistic incompressibility (reply)
F. Cooperstock
,
R. Sarracino
Nature
1977
Corpus ID: 4288413
1977
1977
General relativistic incompressibility
K. Brecher
,
I. Wasserman
Nature
1977
Corpus ID: 43653295
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