Oblivious Symmetric Alternation

DOI10.1007/11672142_18zbMath1137.68026OpenAlexW1518916050MaRDI QIDQ5449801

Venkatesan T. Chakaravarthy, Sambuddha Roy

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11672142_18

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Gate elimination: circuit size lower bounds and \#SAT upper bounds ⋮ Arthur and Merlin as oracles ⋮ The 1-Versus-2 Queries Problem Revisited ⋮ The 1-versus-2 queries problem revisited ⋮ Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly ⋮ On the probabilistic closure of the loose unambiguous hierarchy

This page was built for publication: Oblivious Symmetric Alternation