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 define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity…

2007

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

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…

2007

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

2006

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

2003

The main purpose of this paper is to prove a generalisation of the Krasnoselskii cone compression theorem for theUkc maps of Park…

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…

1997

AbstractSuppose AiBiCi (i = 1, 2) are two triangles of equal side lengths lying on spheres Φi with radii r1, r2 (r1 < r2…

1996