Stanislav Zák

发表

A Lower Bound on Branching Programs Reading Some Bits Twice

Petr Savický, Stanislav Zák, 1997, Theor. Comput. Sci..

A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3

Stanislav Zák, Jirí Síma, 2007, SOFSEM.

On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity

Stanislav Zák, Jirí Síma, 2017, Fundam. Informaticae.

A Turing machine space hierarchy

Stanislav Zák, 1979, Kybernetika.

A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs

Stanislav Zák, 1995, MFCS.

Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs

Stanislav Zák, Jirí Síma, 2011, CSR.

A Logical Characteristic of Read-Once Branching Programs

Stanislav Zák, 2019, Electron. Colloquium Comput. Complex..

A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 pdf

Stanislav Zák, Jirí Síma, 2010, Electron. Colloquium Comput. Complex..

A Turing Machine Oracle Hierarchy

Stanislav Zák, 1979, MFCS.

Inherent logic and complexity

Stanislav Zák, 2015, Electron. Colloquium Comput. Complex..

An Exponential Lower Bound for Real-Time Branching Programs

Stanislav Zák, 1986, Inf. Control..

A subexponential lower bound for branching programs restricted with regard to some semantic aspects

Stanislav Zák, 1997, Electron. Colloquium Comput. Complex..

A Turing Machine Distance Hierarchy

Stanislav Zák, Jirí Síma, 2013, LATA.

On uncertainty versus size in branching programs

Stasys Jukna, Stanislav Zák, 2003, Theor. Comput. Sci..

A Turing Machine Time Hierarchy

Stanislav Zák, S. Zák, 1983, Theor. Comput. Sci..

Some Notes on the Information Flow in Read-Once Branching Programs

Stasys Jukna, Stanislav Zák, 2000, SOFSEM.

A Sharp Separation of Sublogarithmic Space Complexity Classes

Stanislav Zák, 2002, Comput. Artif. Intell..

Polynomial Division on Systolic Arrays

Kai Hwang, Stanislav Zák, K. Hwang, 1985, IEEE Transactions on Computers.

A Hierarchy for (1, +k)-Branching Programs with Respect of k

Petr Savický, Stanislav Zák, 1997, MFCS.

On Branching Programs With Bounded Uncertainty (Extended Abstract)

Stasys Jukna, Stanislav Zák, 1998, ICALP.

A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract)

Stanislav Zák, Jirí Síma, 2012, SOFSEM.

A large lower bound for 1-branching programs

Petr Savický, Stanislav Zák, 1996, Electron. Colloquium Comput. Complex..

A read-once lower bound and a (1, +k)-hierarchy for branching programs

Petr Savický, Stanislav Zák, 2000, Theor. Comput. Sci..