Multilinear formulas and skepticism of quantum computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
An Infinitely-Often One-Way Function Based on an Average-Case Assumption
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Optimizing segment based document protection
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
The existence of one-way functions (owf) is arguably the most important problem in computer theory. The article discusses and refines a number of concepts relevant to this problem. For instance, it gives the first combinatorial complete owf, i.e., a function which is one-way if any function is. There are surprisingly many subtleties in basic definitions. Some of these subtleties are discussed or hinted at in the literature and some are overlooked. Here, a unified approach is attempted.