2479 search results - page 22 / 496 » Quantum complexity theory |
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
ICTIR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. While the Probability Ranking Principle for Information Retrieval provides the basis for formal models, it makes a very strong assumption regarding the dependence between...
PPL
2010
13 years 7 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
CHI
2006
ACM
14 years 9 months ago
2006
ACM
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...