Compression theorem

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

We consider a distributed decoupling task for a tripartite system in which Bob and Charlie “exclude” Alice by destroying…

2007

This is the second of three papers about the Compression Theorem. We give proofs of Gromov's theorem on directed embeddings 1; 2…

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…

2006

This is an exposition of the Compression Theorem of Colin Rourke and Brian Sanderson, which leads to a new proof of the Immersion…

2005

This paper presents new random fixed point theorems and random Leray–Schauder alternatives for a variety of maps (e.g., Bκ, Uκ c…

2005

This lecture is intended to be an easily accessible rst introduction to quantum information theory. The eld is large and it is…

2003

We prove that the degree two map f : S → S, obtained by capping off at infinity an arbitrary sphere eversion S × I → R, is…

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…

2001

We use the compression theorem (cf [7; section 7]) to prove results for equivariant configuration spaces analogous to the well…

2000

We use the compression theorem (cf 7; section 6]) to prove results for equivariant connguration spaces analogous to the well…