CS 6520 - Computational Complexity Fall 2015
Wednesday, September 2, 2015
Lecture 8
Circuit Complexity - P-completeness of circuit value. Polynomial-size circuit families
Completeness in the Polynomial-Time Hierarchy: A Compendium
by Marcus Schaefer and Chris Umans
Newer Post
Older Post
Home