Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
From MaRDI portal
Publication:2922591
DOI10.1007/978-3-662-44465-8_2zbMath1378.94084OpenAlexW2166998594MaRDI QIDQ2922591
Samir Datta, Nikhil Balaji, Eric W. Allender
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_2
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Processing succinct matrices and vectors, On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1, Knapsack and the power word problem in solvable Baumslag–Solitar groups, Tree compression using string grammars, Unnamed Item, Unnamed Item, On the Complexity of Value Iteration, Dynamic complexity of expansion