Arithmetizing Classes Around NC 1 and L
From MaRDI portal
Publication:3590957
DOI10.1007/978-3-540-70918-3_41zbMath1186.68205MaRDI 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
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Resource trade-offs in syntactically multilinear arithmetic circuits, Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}}, Counting paths in VPA is complete for \(\#\mathrm{NC}^1\), Small space analogues of Valiant's classes and the limitations of skew formulas, On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata, Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae