Sciweavers

7486 search results - page 96 / 1498
» The Limits of Quantum Computers
Sort
View
IPL
2000
77views more  IPL 2000»
13 years 8 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 8 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 7 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, ...
SAC
2002
ACM
13 years 8 months ago
Limits in modelling evolving computer-based systems
This paper explores the limitations of one technique for modelling computer-based systems with evolving requirements. A case study is introduced which highlights the importance of...
Massimo Felici, Juliana Küster Filipe
LION
2007
Springer
113views Optimization» more  LION 2007»
14 years 3 months ago
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks
Abstract. The practical utility of optimization technologies is often impacted by factors that reflect how these tools are used in practice, including whether various real-world c...
William E. Hart, Jonathan W. Berry, Erik G. Boman,...