Sciweavers

17 search results - page 4 / 4
» Relativizations of the P =
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
14 years 6 months ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 9 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam