📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth

First Author: Jansen M

Attributed to: Hierarchies, Circuit Lower Bounds and Pseudorandomness funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-22006-7_61

Publication URI: http://dx.doi.org/10.1007/978-3-642-22006-7_61

Type: Book Chapter

Book Title: Automata, Languages and Programming (2011)

Page Reference: 724-735

ISBN: 978-3-642-22005-0