612 search results - page 74 / 123 » Hardness assumptions in the foundations of theoretical compu... |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
CCS
2009
ACM
14 years 8 months ago
2009
ACM
Management of a modern enterprise is based on the assumption that executive reports of lower-layer management are faithful to what is actually happening in the field. As some well...
CCS
2007
ACM
14 years 2 months ago
2007
ACM
Security researchers are applying software reliability models to vulnerability data, in an attempt to model the vulnerability discovery process. I show that most current work on t...
FOCS
1998
IEEE
14 years 1 days ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...