1445 search results - page 163 / 289 » Uniformly Hard Languages |
126
click to vote
FP
1989
15 years 8 months ago
1989
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
145
click to vote
CASES
2004
ACM
15 years 8 months ago
2004
ACM
The tremendous growth of system memories has increased the capacities and capabilities of memory-resident embedded databases, yet current embedded databases need to be tuned in or...
151
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
143
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
174
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...