612 search results - page 74 / 123 » Hardness assumptions in the foundations of theoretical compu... |
179
click to vote
COCO
2009
Springer
16 years 23 days 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...
163
click to vote
ICALP
2007
Springer
16 years 10 days 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...
167
click to vote
CCS
2009
ACM
16 years 6 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...
174
click to vote
CCS
2007
ACM
16 years 11 days 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...
194
click to vote
FOCS
1998
IEEE
15 years 10 months 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...