Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
DOI10.2168/LMCS-8(3:9)2012zbMATH Open1256.68079arXiv1207.0393MaRDI QIDQ2904626
Publication date: 15 August 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.0393
2-person games (91A05) Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonstandard models of arithmetic (03H15) Complexity of proofs (03F20)
This page was built for publication: Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904626)