Sciweavers

3328 search results - page 91 / 666
» Topological Quantum Computation
Sort
View
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
14 years 4 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
IPL
2000
77views more  IPL 2000»
13 years 10 months ago
Simplified proof of the Fourier Sampling Theorem
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
Peter Høyer
TCS
2002
13 years 9 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
LOGCOM
2010
85views more  LOGCOM 2010»
13 years 8 months ago
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
Félix Bou, Francesco Paoli, Antonio Ledda, ...
CVBIA
2005
Springer
14 years 3 months ago
Active Contours Under Topology Control Genus Preserving Level Sets
We present a novel framework to exert topology control over a level set evolution. Level set methods offer several advantages over parametric active contours, in particular automat...
Florent Ségonne, Jean-Philippe Pons, W. Eri...