Stanislav Zak

Available identifiers

zbMath Open zak.stanislavMaRDI QIDQ593779

List of research outcomes

Publication	Date of Publication	Type
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3	2022-03-09	Paper
On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity	2017-12-05	Paper
A Turing Machine Distance Hierarchy	2013-03-18	Paper
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3	2012-06-15	Paper
Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs	2011-06-17	Paper
A superpolynomial lower bound for (1,+k(n))-branching programs	2010-06-17	Paper
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3	2008-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q4680181	2005-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q4471998	2004-08-03	Paper
On uncertainty versus size in branching programs.	2003-08-17	Paper
A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs	2000-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4699324	1999-11-10	Paper
A lower bound on branching programs reading some bits twice	1998-07-23	Paper
An exponential lower bound for real-time branching programs	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3347300	1984-01-01	Paper
Letter to the editor	1984-01-01	Paper
A Turing machine time hierarchy	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3867185	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3867186	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3048250	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3854629	1979-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Stanislav Zak