Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,488,179 papers from all fields of science
Search
Sign In
Create Free Account
Compression theorem
In computational complexity theory the compression theorem is an important theorem about the complexity of computable functions. The theorem states…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Complexity class
Computable function
Computational complexity theory
Gödel numbering
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings
Bastien Cazaux
,
Eric Rivals
Stringology
2014
Corpus ID: 41093145
Covering a directed graph by a Hamiltonian path or a set of words by a superstring belong to well studied optimisation problems…
Expand
2011
2011
On the Meaning of Focalization
Michele Basaldella
,
A. Saurin
,
K. Terui
PRELUDE Project
2011
Corpus ID: 6010348
In this paper, we use Girard's ludics to analyze focalization, a fundamental property of the proof theory of linear logic. In…
Expand
2007
2007
Quantum Source Coding and Data Compression
D. Petz
2007
Corpus ID: 115622553
This lecture is intended to be an easily accessible first introduction to quantum information theory. The field is large and it…
Expand
2005
2005
An Implicit Wavelet Sparse Approximate Inverse Preconditioner
S. Hawkins
,
Ke Chen
SIAM J. Sci. Comput.
2005
Corpus ID: 25872246
Wavelet-based sparse approximate inverse preconditioners are considered for the linear system Ax=b. The preconditioners are good…
Expand
Highly Cited
2003
Highly Cited
2003
A Direct Sum Theorem in Communication Complexity via Message Compression
Rahul Jain
,
J. Radhakrishnan
,
P. Sen
ICALP
2003
Corpus ID: 687265
We prove lower bounds for the direct sum problem for two-party bounded error randomised multiple-round communication protocols…
Expand
2003
2003
A KRASNOSELSKII CONE COMPRESSION THEOREM FOR Ukc MAPS By DONAL O’REGAN* Department of Mathematics, National University of Ireland, Galway
D. O’Regan
2003
Corpus ID: 14814967
The main purpose of this paper is to prove a generalisation of the Krasnoselskii cone compression theorem for theUkc maps of Park…
Expand
2002
2002
Statistical mechanics of data compression theorem
T. Murayama
Proceedings IEEE International Symposium on…
2002
Corpus ID: 121895035
We analyze the performance of a linear code used for data compression of a Slepian-Wolf type. In our framework, two correlated…
Expand
1997
1997
Compression Theorems and Steiner Ratios on Spheres
J. Rubinstein
,
J. Weng
J. Comb. Optim.
1997
Corpus ID: 35145869
AbstractSuppose AiBiCi (i = 1, 2) are two triangles of equal side lengths lying on spheres Φi with radii r1, r2 (r1 < r2…
Expand
1994
1994
A Recursive Introduction to the Theory of Computation
Carl H. Smith
Graduate Texts in Computer Science
1994
Corpus ID: 206656265
From the Publisher: The aim of this textbook is to present an account of the theory of computation. After introducing the…
Expand
Highly Cited
1975
Highly Cited
1975
A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
T. Cover
IEEE Trans. Inf. Theory
1975
Corpus ID: 7177935
If \{(X_i, Y_i)\}_{i=1}^{\infty} is a sequence of independent identically distributed discrete random pairs with (X_i, Y_i) ~ p(x…
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