Amanote Research
Register
Sign In
Optimal Lower Bounds for Quantum Automata and Random Access Codes
doi 10.1109/sffcs.1999.814608
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
A. Nayak
Publisher
IEEE Comput. Soc
Related search
Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines
Journal of the ACM
Control
Systems Engineering
Information Systems
Hardware
Architecture
Artificial Intelligence
Software
Improved Lower Bounds for Multicovering Codes
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
Lower Bounds for Complementation of Omega-Automata via the Full Automata Technique
Logical Methods in Computer Science
Computer Science
Theoretical Computer Science
Linear Sum Codes for Random Access Memories
IEEE Transactions on Computers
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
Extended Formulation Lower Bounds for Refuting Random CSPs
Lower Bounds for the Length of Reset Words in Eulerian Automata
International Journal of Foundations of Computer Science
Computer Science
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation
Primary-Backup Protocols: Lower Bounds and Optimal Implementations
Dependable Computing and Fault-Tolerant Systems
