Chipping away at P vs NP: How far are we from proving circuit size lower bounds?

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationTheory of Computing 2008 - Proceedings of the Fourteenth Computing
Subtitle of host publicationThe Australasian Theory Symposium, CATS 2008
StatePublished - Dec 1 2008
EventTheory of Computing 2008 - 14th Computing: The Australasian Theory Symposium, CATS 2008 - Wollongong, NSW, Australia
Duration: Jan 22 2008Jan 25 2008

Publication series

NameConferences in Research and Practice in Information Technology Series
Volume77

Other

OtherTheory of Computing 2008 - 14th Computing: The Australasian Theory Symposium, CATS 2008
CountryAustralia
CityWollongong, NSW
Period1/22/081/25/08

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Allender, E. (2008). Chipping away at P vs NP: How far are we from proving circuit size lower bounds? In Theory of Computing 2008 - Proceedings of the Fourteenth Computing: The Australasian Theory Symposium, CATS 2008 (Conferences in Research and Practice in Information Technology Series; Vol. 77).