{"id":"https://openalex.org/W7160417547","doi":"https://doi.org/10.46298/lmcs-22(2:14)2026","title":"On $NP \\cap coNP$ proof complexity generators","display_name":"On $NP \\cap coNP$ proof complexity generators","publication_year":2026,"publication_date":"2026-05-06","ids":{"openalex":"https://openalex.org/W7160417547","doi":"https://doi.org/10.46298/lmcs-22(2:14)2026"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-22(2:14)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(2:14)2026","pdf_url":"https://lmcs.episciences.org/18158/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":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/18158/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135514551","display_name":"Jan Krajicek","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jan Krajicek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5135514551"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.9483033,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 22, Issue 2","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.8614000082015991,"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.8614000082015991,"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.08789999783039093,"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/T11567","display_name":"semigroups and automata theory","score":0.006300000008195639,"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/proof-complexity","display_name":"Proof complexity","score":0.6516000032424927},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.5322999954223633},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5285000205039978},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.5110999941825867},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5009999871253967},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.4172999858856201},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4172999858856201},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.3686000108718872}],"concepts":[{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.6516000032424927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5687999725341797},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.5322999954223633},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5285000205039978},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.5110999941825867},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5009999871253967},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48590001463890076},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4172999858856201},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.4172999858856201},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.3686000108718872},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.3334999978542328},{"id":"https://openalex.org/C135754263","wikidata":"https://www.wikidata.org/wiki/Q4751136","display_name":"Analytic proof","level":3,"score":0.3264000117778778},{"id":"https://openalex.org/C173613240","wikidata":"https://www.wikidata.org/wiki/Q1150675","display_name":"Computer-assisted proof","level":3,"score":0.3091000020503998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.305400013923645},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.3001999855041504},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C58312451","wikidata":"https://www.wikidata.org/wiki/Q4817200","display_name":"Atom (system on chip)","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-22(2:14)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(2:14)2026","pdf_url":"https://lmcs.episciences.org/18158/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"}],"best_oa_location":{"id":"doi:10.46298/lmcs-22(2:14)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(2:14)2026","pdf_url":"https://lmcs.episciences.org/18158/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":[{"score":0.45368075370788574,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7160417547.pdf","grobid_xml":"https://content.openalex.org/works/W7160417547.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1,17],"the":[2,10,59,66,83,104],"theory":[3,114],"of":[4,27,77,85,106,108,110],"proof":[5,20,56],"complexity":[6],"generators":[7],"we":[8],"consider":[9],"following":[11],"$\u03a3^p_2$":[12],"search":[13],"problem":[14,60],"$\\mbox{DD}_P$":[15,61],"determined":[16],"a":[18,24,28,49,70,74,92,111],"propositional":[19],"system":[21,57],"$P$:":[22],"given":[23],"$P$-proof":[25],"$\u03c0$":[26],"disjunction":[29],"$\\bigvee_i":[30],"\u03b1_i$,":[31],"no":[32],"two":[33],"$\u03b1_i$":[34],"having":[35],"an":[36],"atom":[37],"in":[38,65],"common,":[39],"find":[40],"$i$":[41],"such":[42],"that":[43,52,95],"$\u03b1_i":[44],"\\in":[45],"\\mbox{TAUT}$.":[46],"We":[47,89],"formulate":[48],"hypothesis":[50,80],"(ST)":[51,96],"for":[53],"some":[54],"strong":[55],"$P$":[58],"is":[62,117],"not":[63],"solvable":[64],"student-teacher":[67],"model":[68],"with":[69],"$p$-time":[71],"student":[72],"and":[73,115],"constant":[75],"number":[76],"rounds.":[78],"The":[79,101],"follows":[81],"from":[82],"existence":[84,105],"hard":[86],"one-way":[87],"permutations.":[88],"prove,":[90],"using":[91],"model-theoretic":[93],"assumption,":[94],"implies":[97],"$NP":[98],"\\neq":[99],"coNP$.":[100],"assumption":[102],"concerns":[103],"extensions":[107],"models":[109],"bounded":[112],"arithmetic":[113],"it":[116,122],"open":[118],"at":[119],"present":[120],"if":[121],"holds.":[123]},"counts_by_year":[],"updated_date":"2026-05-08T13:12:06.581006","created_date":"2026-05-07T00:00:00"}