{"id":"https://openalex.org/W2165277926","doi":"https://doi.org/10.2168/lmcs-8(3:9)2012","title":"Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator","display_name":"Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator","publication_year":2012,"publication_date":"2012-08-13","ids":{"openalex":"https://openalex.org/W2165277926","doi":"https://doi.org/10.2168/lmcs-8(3:9)2012","mag":"2165277926"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(3:9)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:9)2012","pdf_url":"https://lmcs.episciences.org/788/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/788/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jan Kraj\u00ed\u010dek","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jan Kraj\u00ed\u010dek","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.17644609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"Volume 8, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7713000178337097,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7713000178337097,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.13600000739097595,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.009999999776482582,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.7552000284194946},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.6541000008583069},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6398000121116638},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.571399986743927},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5608000159263611},{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.5022000074386597},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.49239999055862427},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4821999967098236}],"concepts":[{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.7552000284194946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6944000124931335},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.6541000008583069},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6398000121116638},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.571399986743927},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5608000159263611},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.5022000074386597},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.49239999055862427},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4821999967098236},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4259999990463257},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.400299996137619},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39959999918937683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3853999972343445},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.38510000705718994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3783999979496002},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3537999987602234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25119999051094055},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.25060001015663147},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.25}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-8(3:9)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:9)2012","pdf_url":"https://lmcs.episciences.org/788/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1207.0393","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1207.0393","pdf_url":"https://arxiv.org/pdf/1207.0393","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0385494","is_oa":true,"landing_page_url":"http://hdl.handle.net/11104/0214718","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:d81fc0a438b449a4bf0e7d73aae92273","is_oa":true,"landing_page_url":"https://doaj.org/article/d81fc0a438b449a4bf0e7d73aae92273","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(3:9)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:9)2012","pdf_url":"https://lmcs.episciences.org/788/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2165277926.pdf","grobid_xml":"https://content.openalex.org/works/W2165277926.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W889431080","https://openalex.org/W959768158","https://openalex.org/W1998918799","https://openalex.org/W2068961663","https://openalex.org/W2079068382","https://openalex.org/W2160403361","https://openalex.org/W4248733413"],"related_works":[],"abstract_inverted_index":{"For":[0],"an":[1],"NP":[2],"intersect":[3],"coNP":[4],"function":[5],"g":[6,95],"of":[7,43,51,63,66,70,102,131,150,169],"the":[8,30,48,61,64,75,129],"Nisan-Wigderson":[9],"type":[10],"and":[11,79,172],"a":[12,20,25,28,34,41,56,78,99,103,111,125,133,147,166,176],"string":[13],"b":[14],"outside":[15],"its":[16],"range":[17],"we":[18,123,142],"consider":[19],"two":[21],"player":[22],"game":[23],"on":[24,98,117,128,153],"common":[26],"input":[27],"to":[29,39,83,180],"function.":[31],"One":[32],"player,":[33],"computationally":[35,57],"limited":[36],"Student,":[37],"tries":[38],"find":[40],"bit":[42,50,101],"g(a)":[44],"that":[45,93,141,144],"differs":[46],"from":[47,77,80],"corresponding":[49],"b.":[52],"He":[53],"can":[54,115],"query":[55],"unlimited":[58],"Teacher":[59],"for":[60],"witnesses":[62],"values":[65],"constantly":[67],"many":[68],"bits":[69],"g(a).":[71],"The":[72,160],"Student":[73,108,136],"computes":[74],"queries":[76],"Teacher's":[81],"answers":[82],"his":[84],"previous":[85],"queries.":[86],"It":[87],"was":[88],"proved":[89],"by":[90,110],"Krajicek":[91],"(2011)":[92],"if":[94],"is":[96,146,163],"based":[97],"hard":[100,151],"one-way":[104],"permutation":[105],"then":[106],"no":[107],"computed":[109],"polynomial":[112],"size":[113],"circuit":[114],"succeed":[116],"all":[118,155],"a.":[119],"In":[120],"this":[121],"paper":[122],"give":[124],"lower":[126],"bound":[127],"number":[130],"inputs":[132],"any":[134],"such":[135],"must":[137,158],"fail":[138],"on.":[139],"Using":[140],"show":[143],"there":[145],"pseudo-finite":[148],"set":[149,162],"instances":[152],"which":[154],"uniform":[156],"students":[157],"fail.":[159],"hard-core":[161],"defined":[164],"in":[165,175],"non-standard":[167],"model":[168],"true":[170],"arithmetic":[171],"has":[173],"applications":[174],"forcing":[177],"construction":[178],"relevant":[179],"proof":[181],"complexity.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":27}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}