In computational complexity theory the compression theorem is an important theorem about the complexity of computable functions. The theorem statesâ€¦Â (More)

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)

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

- Igor Bjelakovic, Arleta Szkola
- Quantum Information Processing
- 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

- Ukc MAPS, Donal Oâ€™Regan
- 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

- Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
- ICALP
- 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)

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)

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)

Is this relevant?

2000

2000

- Bert Wiest, Ronald A. Fintushel
- 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)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- Thomas M. Cover
- IEEE Trans. Information Theory
- 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?