{"id":"https://openalex.org/W167499397","doi":"https://doi.org/10.1017/9781009611664","title":"Proof Complexity Generators","display_name":"Proof Complexity Generators","publication_year":2025,"publication_date":"2025-05-29","ids":{"openalex":"https://openalex.org/W167499397","doi":"https://doi.org/10.1017/9781009611664","mag":"167499397"},"language":"en","primary_location":{"id":"doi:10.1017/9781009611664","doi":"https://doi.org/10.1017/9781009611664","is_oa":false,"landing_page_url":"https://doi.org/10.1017/9781009611664","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"monograph"},"volume":null,"type":"book","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5117720924","display_name":"Jan Kraj\u00ed\u010dek","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Kraj\u00ed\u010dek","raw_affiliation_strings":["Charles University, Prague"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5117720924"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":1.0108,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81494662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"3","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.8217999935150146,"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.8217999935150146,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.06030000001192093,"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.035999998450279236,"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.871999979019165},{"id":"https://openalex.org/keywords/p-versus-np","display_name":"P versus NP","score":0.7879999876022339},{"id":"https://openalex.org/keywords/proof-systems","display_name":"proof systems","score":0.7480000257492065},{"id":"https://openalex.org/keywords/bounded-arithmetic","display_name":"bounded arithmetic","score":0.8500000238418579},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"computational complexity theory","score":0.5960000157356262}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46606260538101196}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/9781009611664","doi":"https://doi.org/10.1017/9781009611664","is_oa":false,"landing_page_url":"https://doi.org/10.1017/9781009611664","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"monograph"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-035725760","doi":null,"is_oa":false,"landing_page_url":"https://bvbr.bib-bvb.de:443/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=035725760&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:167499397","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/acid/acid2006.html#Krajicek06","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7098605106","https://openalex.org/W1676672341","https://openalex.org/W1542523297","https://openalex.org/W4388911622","https://openalex.org/W1004442306","https://openalex.org/W2202163874","https://openalex.org/W2106792056","https://openalex.org/W2091961944","https://openalex.org/W6966961855","https://openalex.org/W2563084828"],"abstract_inverted_index":{"The":[0,25],"P":[1],"vs.":[2,64],"NP":[3,63],"problem":[4,26,61,112],"is":[5,58],"one":[6,34],"of":[7,11,67,123,126,139],"the":[8,31,52,59,85,99,106,118,127],"fundamental":[9],"problems":[10,134],"mathematics.":[12],"It":[13,97],"asks":[14],"whether":[15],"propositional":[16,40],"tautologies":[17,41],"can":[18],"be":[19,28],"recognized":[20],"by":[21,80,102],"a":[22,81,90,110,121],"polynomial-time":[23],"algorithm.":[24],"would":[27],"solved":[29],"in":[30,84,113],"negative":[32],"if":[33],"could":[35],"show":[36],"that":[37,42],"there":[38],"are":[39,43],"very":[44],"hard":[45,95],"to":[46,135],"prove,":[47],"no":[48],"matter":[49],"how":[50],"powerful":[51],"proof":[53,68],"system":[54],"you":[55],"use.":[56],"This":[57],"foundational":[60],"(the":[62],"coNP":[65],"problem)":[66],"complexity,":[69],"an":[70],"area":[71],"linking":[72],"mathematical":[73],"logic":[74],"and":[75,109],"computational":[76],"complexity":[77],"theory.":[78],"Written":[79],"leading":[82],"expert":[83],"field,":[86],"this":[87],"book":[88],"presents":[89],"theory":[91,100],"for":[92],"constructing":[93],"such":[94],"tautologies.":[96],"introduces":[98],"step":[101],"step,":[103],"starting":[104],"with":[105],"historic":[107],"background":[108],"motivational":[111],"bounded":[114],"arithmetic,":[115],"before":[116],"taking":[117],"reader":[119],"on":[120],"tour":[122],"various":[124],"vistas":[125],"field.":[128],"Finally,":[129],"it":[130],"formulates":[131],"several":[132],"research":[133],"highlight":[136],"new":[137],"avenues":[138],"research.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}