Sciweavers

1391 search results - page 23 / 279
» Complexity Limitations on Quantum Computation
Sort
View
SIGCSE
2002
ACM
88views Education» more  SIGCSE 2002»
13 years 7 months ago
Teaching computer organization/architecture with limited resources using simulators
As the complexity and variety of computer system hardware increases, its suitability as a pedagogical tool in computer organization/architecture courses diminishes. As a consequen...
Gregory S. Wolffe, William Yurcik, Hugh Osborne, M...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 1 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
ICALP
2003
Springer
14 years 27 days ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
UC
2009
Springer
14 years 2 months ago
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...
Karl Svozil
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 8 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li