- Scott Aaronson. 2003. Is P versus NP formally independent? Bull. EATCS 81 (2003), 109--136.Google Scholar
- Barış Aydınlıoğlu and Eric Bach. 2018. Affine relativization: Unifying the algebrization and relativization barriers. ACM Trans. Comput. Theory 10, 1 (2018), 1:1--1:67. Google Scholar
Digital Library
- Martin Löb. 1955. Solution of a problem of Leon Henkin. J. Symbol. Logic 20, 2 (1955), 115--118.Google Scholar
Cross Ref
Index Terms
Corrigendum to Affine Relativization: Unifying the Algebrization and Relativization Barriers
Recommendations
Affine Relativization: Unifying the Algebrization and Relativization Barriers
We strengthen existing evidence for the so-called “algebrization barrier.” Algebrization—short for algebraic relativization—was introduced by Aaronson and Wigderson (AW) (STOC 2008) to characterize proofs involving arithmetization, simulation, and other ...
An axiomatic approach to algebrization
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computingNon-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's, a sequence of important non-relativizing results was proved, mainly using algebraic ...
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems
The Minimum Circuit Size Problem (MCSP) and a related problem (MKTP) that deal with time-bounded Kolmogorov complexity are prominent candidates for NP-intermediate status. We show that, under very modest cryptographic assumptions (such as the existence ...






Comments