612 search results - page 21 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
IWANN
2005
Springer
14 years 1 months ago
2005
Springer
Computing in nature as is the case with the human brain is an emerging research area in theoretical computer science. The present paper’s aim is to explore biological neural cell...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Given any two images taken under different illumination conditions, there always exist a physically realizable object which is consistent with both the images even if the lighting...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
SEC
2000
13 years 9 months ago
2000
The theory of computer viruses has been studied by several authors, though there is no systematic theoretical study up to now. The long time open question in this area is as follo...