Arithmetizing Classes Around NC 1 and L

DOI10.1007/978-3-540-70918-3_41zbMath1186.68205OpenAlexW1589335334MaRDI QIDQ3590957

Meena Mahajan, B. V. Raghavendra Rao, Nutan Limaye

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_41

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Resource trade-offs in syntactically multilinear arithmetic circuits ⋮ On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata ⋮ Small space analogues of Valiant's classes and the limitations of skew formulas ⋮ Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) ⋮ Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} ⋮ Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae

This page was built for publication: Arithmetizing Classes Around NC 1 and L