612 search results - page 5 / 123 » Hardness assumptions in the foundations of theoretical compu... |
191
click to vote
ITICSE
2004
ACM
16 years 4 days ago
2004
ACM
With our interest to improve our education in computer science, an understanding of how students learn about CS concepts, how different concepts are understood, as well as the con...
189
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
167
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...