Nondeterministic functions and the existence of optimal proof systems
O Beyersdorff, J Köbler, J Messner - Theoretical Computer Science, 2009 - Elsevier
We provide new characterizations of two previously studied questions on nondeterministic
function classes: We show that Q1 for the class NPMVt is equivalent to the question whether …
function classes: We show that Q1 for the class NPMVt is equivalent to the question whether …
The shrinking property for NP and coNP
C Glaßer, C Reitwießner, V Selivanov - Theoretical Computer Science, 2011 - Elsevier
We study the shrinking and separation properties (two notions well-known in descriptive set
theory) for NP and coNP and show that under reasonable complexity-theoretic assumptions …
theory) for NP and coNP and show that under reasonable complexity-theoretic assumptions …
The shrinking property for NP and coNP
C Glaßer, C Reitwießner, V Selivanov - … 2008, Athens, Greece, June 15-20 …, 2008 - Springer
We study the shrinking and separation properties (two notions well-known in descriptive set
theory) for and and show that under reasonable complexity-theoretic assumptions, both …
theory) for and and show that under reasonable complexity-theoretic assumptions, both …
On the circuit-size of inverses
JC Birget - International journal of foundations of computer …, 2011 - World Scientific
We reprove a result of Boppana and Lagarias: If then there exists a partial function f that is
computable by a polynomial-size family of circuits, but no inverse of f is computable by a …
computable by a polynomial-size family of circuits, but no inverse of f is computable by a …