Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

We show that if Arthur-Merlin protocols can be derandomized, then there is a Boolean function computable in deterministic exponential-time with access to an NP oracle, that cannot be computed by Boolean circuits of exponential size. More formally, if prAM ⊆ P NP then there is a Boolean function in E...

Full description

Bibliographic Details

Published in:	2010 IEEE 25th Annual Conference on Computational Complexity pp. 38 - 49
Main Authors:	Gutfreund, Dan, Kawachi, Akinori
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2010
Subjects:	Access protocols Analog computers approximate counting Arthur-Merlin protocols Boolean functions circuit complexity Circuits Complexity theory Computational complexity derandomization Phase change random access memory Polynomials Turing machines
ISBN:	9781424472147, 1424472148
ISSN:	1093-0159
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!