Stanislav Zák A Sharp Separation of Sublogarithmic Space Complexity Classes. [Citation Graph (0, 0)][DBLP] Computers and Artificial Intelligence, 2002, v:21, n:6, pp:- [Journal]
Stanislav Zák A subexponential lower bound for branching programs restricted with regard to some semantic aspects [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:50, pp:- [Journal]
Stanislav Zák An Exponential Lower Bound for Real-Time Branching Programs [Citation Graph (0, 0)][DBLP] Information and Control, 1986, v:71, n:1/2, pp:87-94 [Journal]
Jirí Síma, Stanislav Zák A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. [Citation Graph (0, 0)][DBLP] SOFSEM (1), 2007, pp:522-531 [Conf]
Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP