Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator - MaRDI portal

Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator

From MaRDI portal
Publication:2904626

DOI10.2168/LMCS-8(3:9)2012zbMATH Open1256.68079arXiv1207.0393MaRDI QIDQ2904626

Jan Krajíček

Publication date: 15 August 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: For an NP intersect coNP function g of the Nisan-Wigderson type and a string b outside its range we consider a two player game on a common input a to the function. One player, a computationally limited Student, tries to find a bit of g(a) that differs from the corresponding bit of b. He can query a computationally unlimited Teacher for the witnesses of the values of constantly many bits of g(a). The Student computes the queries from a and from Teacher's answers to his previous queries. It was proved by Krajicek (2011) that if g is based on a hard bit of a one-way permutation then no Student computed by a polynomial size circuit can succeed on all a. In this paper we give a lower bound on the number of inputs a any such Student must fail on. Using that we show that there is a pseudo-finite set of hard instances on which all uniform students must fail. The hard-core set is defined in a non-standard model of true arithmetic and has applications in a forcing construction relevant to proof complexity.


Full work available at URL: https://arxiv.org/abs/1207.0393











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)