Sciweavers

3 search results - page 1 / 1
» Nonembeddability theorems via Fourier analysis
Sort
View
FOCS
2005
IEEE
13 years 10 months ago
Nonembeddability theorems via Fourier analysis
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 ā...
Subhash Khot, Assaf Naor
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
13 years 11 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the veriļ¬er and the veriļ¬erā€™s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
COMBINATORICS
1998
86views more  COMBINATORICS 1998»
13 years 4 months ago
Lattice Tilings by Cubes: Whole, Notched and Extended
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
Mihail N. Kolountzakis