Sciweavers

3713 search results - page 23 / 743
» Quantum Information Theory
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 22 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 7 months ago
A Refined Difference Field Theory for Symbolic Summation
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. ...
Carsten Schneider
ISCI
2000
83views more  ISCI 2000»
13 years 7 months ago
Active agents, intelligence and quantum computing
This paper reviews evidence from neuroscience and quantum computing theory in support of the notion of autonomy in the workings of cognitive processes. De
Subhash C. Kak
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 7 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
COCO
2004
Springer
95views Algorithms» more  COCO 2004»
14 years 27 days ago
Consequences and Limits of Nonlocal Strategies
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...
Richard Cleve, Peter Høyer, Benjamin Toner,...