Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference19 articles.
1. Σ11-Formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1983
2. Babai, L. (1984), private communication.
3. Lower bounds for very powerful parallel machines;Beame,1985
4. Constant depth reducibility;Chandra;SIAM J. Comput.,1984
5. Upper and lower time bounds for parallel random access machines without simultaneous writes;Cook;SIAM J. Comput.,1984
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Impossibility Results for Distributed Computing;Synthesis Lectures on Distributed Computing Theory;2014-06-19
2. POLYNOMIAL TIME-BOUNDED COMPUTATIONS IN SPIKING NEURAL P SYSTEMS;Neural Network World;2013
3. Time and Space Lower Bounds for Implementations Using k-CAS;IEEE Transactions on Parallel and Distributed Systems;2010-02
4. Time and Space Lower Bounds for Implementations Using k-CAS;Lecture Notes in Computer Science;2005
5. The Incompressibility Method;An Introduction to Kolmogorov Complexity and Its Applications;1997