Compression theorem

In computational complexity theory the compression theorem is an important theorem about the complexity of computable functions. The theorem states… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2014
012319752014

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
The compression theorem solves a 20 year old problem [2; problem 6]. Applications include short new proofs for immersion theory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2007
2007
This is the third of three papers about the Compression Theorem: if M m is embedded in Q q R with a normal vector eld and if q… (More)
Is this relevant?
2005
2005
We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically… (More)
Is this relevant?
2003
2003
The main purpose of this paper is to prove a generalisation of the Krasnoselskii cone compression theorem for theUkc maps of Park… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols… (More)
Is this relevant?
2003
2003
This is the third of three papers about the Compression Theorem: if Mm is embedded in Qq ×R with a normal vector field and if q−m… (More)
  • figure 1
Is this relevant?
2001
2001
This the first of a set of three papers about the Compression Theorem: if M is embedded in Q ×R with a normal vector field and if… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2001
2001
This is the second of three papers about the Compression Theorem. We give proofs of Gromov’s theorem on directed embeddings [1; 2… (More)
  • figure 2
Is this relevant?
2000
2000
For a smooth, finite-dimensional manifold M with a submanifold S we study the topology of the straight loop space Ωst SM , the… (More)
  • figure 1
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Let P(i) = (1 0)B’ be a peobability assignment on the set of nonnegative integers where 0 is an arbitrary real number, 0 < 0 < 1… (More)
Is this relevant?