Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SEMIUNBOUNDED CIRCUITS:
Reports tagged with Semiunbounded circuits:
TR14-122 | 30th September 2014
Eric Allender, Anna Gal, Ian Mertz

Dual VP Classes

Revisions: 2

We consider arithmetic complexity classes that are in some sense dual to the classes VP(Fp) that were introduced by Valiant. This provides new characterizations of the complexity classes ACC^1 and TC^1, and also provides a compelling example of
a class of high-degree polynomials that can be simulated via arithmetic circuits ... more >>>




ISSN 1433-8092 | Imprint