Amanote Research
Register
Sign In
Small PCPs With Low Query Complexity
Computational Complexity
- Switzerland
doi 10.1007/pl00001606
Full Text
Open PDF
Abstract
Available in
full text
Categories
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Date
December 1, 2000
Authors
P. Harsha
M. Sudan
Publisher
Springer Science and Business Media LLC
Related search
Constant Rate PCPs for Circuit-Sat With Sublinear Query Complexity
Query Processing of Spatial Objects: Complexity Versus Redundancy
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Combinatorial PCPs With Efficient Verifiers
Relaxed Locally Correctable Codes With Nearly-Linear Block Length and Constant Query Complexity
Design of Broadband Beamformers With Low Complexity
Eurasip Journal on Advances in Signal Processing
Hardware
Electronic Engineering
Signal Processing
Electrical
Architecture
Reinforcement Learning With Low-Complexity Liquid State Machines
Frontiers in Neuroscience
Neuroscience
Low Complexity Distributed Video Coding With Golay Codes
International Journal of Machine Learning and Computing
Management
Computer Science Applications
Information Systems
Artificial Intelligence
Randomness-Efficient Low Degree Tests and Short PCPs via Epsilon-Biased Sets
On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
