An axiomatic approach to algebrization

DOI10.1145/1536414.1536509zbMath1304.68055OpenAlexW2161202133MaRDI QIDQ5172767

Russell Impagliazzo, Antonina Kolokolova, Valentine Kabanets

Publication date: 4 February 2015

Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.8271

zbMATH Keywords

independencerelativizationalgebraization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Improved Merlin-Arthur protocols for central problems in fine-grained complexity

This page was built for publication: An axiomatic approach to algebrization