Fundamentals of Computation Theory
From MaRDI portal
Publication:5900807
DOI10.1007/b11926zbMath1278.68096OpenAlexW2249105474MaRDI QIDQ5900807
Richard J. Lipton, Anastasios Viglas
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11926
Related Items
Amplifying circuit lower bounds against polynomial time, with applications, On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape, Parallelizing time with polynomial circuits, A lower bound for primality, Improved simulation of nondeterministic Turing machines