{"id":"https://openalex.org/W2159783982","doi":"https://doi.org/10.2178/jsl/1120224731","title":"Structured pigeonhole principle, search problems and hard tautologies","display_name":"Structured pigeonhole principle, search problems and hard tautologies","publication_year":2005,"publication_date":"2005-06-01","ids":{"openalex":"https://openalex.org/W2159783982","doi":"https://doi.org/10.2178/jsl/1120224731","mag":"2159783982"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1120224731","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1120224731","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},"type":"article","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/A5069803587","display_name":"Jan Kraj\u0131\u0301\u010dek","orcid":"https://orcid.org/0000-0003-0670-3957"},"institutions":[{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Kraj\u00ed\u010dek","raw_affiliation_strings":["Mathematical Institute, Academy of Sciences, \u017ditn\u00c1 25, Prague 1, CZ - 115 67 The Czech Republic, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, Academy of Sciences, \u017ditn\u00c1 25, Prague 1, CZ - 115 67 The Czech Republic, E-mail:","institution_ids":["https://openalex.org/I4210120266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069803587"],"corresponding_institution_ids":["https://openalex.org/I4210120266"],"apc_list":null,"apc_paid":null,"fwci":0.6651,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.73519777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"70","issue":"2","first_page":"619","last_page":"630"},"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.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.8502529859542847},{"id":"https://openalex.org/keywords/tautology","display_name":"Tautology (logic)","score":0.7574514746665955},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.663820743560791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6279311776161194},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5585477948188782},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5505639314651489},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5260602831840515},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.42715027928352356},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41873010993003845},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22621572017669678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22372767329216003}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.8502529859542847},{"id":"https://openalex.org/C166374712","wikidata":"https://www.wikidata.org/wiki/Q209555","display_name":"Tautology (logic)","level":5,"score":0.7574514746665955},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.663820743560791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6279311776161194},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5585477948188782},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5505639314651489},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5260602831840515},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.42715027928352356},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41873010993003845},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22621572017669678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22372767329216003},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.0},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2178/jsl/1120224731","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1120224731","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1120224731","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1120224731","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"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":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.2992","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.2992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cas.cz/~krajicek/hard.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1531368347","https://openalex.org/W1607926272","https://openalex.org/W1964394232","https://openalex.org/W1988083342","https://openalex.org/W2006367699","https://openalex.org/W2026967932","https://openalex.org/W2036503832","https://openalex.org/W2037028865","https://openalex.org/W2045472305","https://openalex.org/W2054013713","https://openalex.org/W2056827464","https://openalex.org/W2063416709","https://openalex.org/W2068363706","https://openalex.org/W2074374872","https://openalex.org/W2075488709","https://openalex.org/W2080353886","https://openalex.org/W2088421560","https://openalex.org/W2095226356","https://openalex.org/W2110053319","https://openalex.org/W2117420234","https://openalex.org/W2143313747","https://openalex.org/W2170605748","https://openalex.org/W2171353564","https://openalex.org/W2196559987","https://openalex.org/W2330548796","https://openalex.org/W2405029069","https://openalex.org/W4210694990","https://openalex.org/W4213091458","https://openalex.org/W4255046774","https://openalex.org/W6659735604","https://openalex.org/W6663619260","https://openalex.org/W6676537246"],"related_works":["https://openalex.org/W4288055874","https://openalex.org/W4313407580","https://openalex.org/W1662675122","https://openalex.org/W2068071783","https://openalex.org/W2098308941","https://openalex.org/W3013031282","https://openalex.org/W2531336559","https://openalex.org/W2063658344","https://openalex.org/W2165390183","https://openalex.org/W2159783982"],"abstract_inverted_index":{"Abstract":[0],"We":[1,29],"consider":[2],"exponentially":[3],"large":[4],"finite":[5],"relational":[6],"structures":[7,34],"(with":[8],"the":[9,105,143,161],"universe":[10],"{0,":[11,63,67],"1}":[12,64,68],"n":[13,24,65,71,92,100],")":[14,27,86],"whose":[15],"basic":[16],"relations":[17],"are":[18],"computed":[19],"by":[20,38],"polynomial":[21],"size":[22,91,98,129,135],"(":[23],"O":[25],"(1)":[26],"circuits.":[28],"study":[30],"behaviour":[31],"of":[32,84,146,154,163,166],"such":[33],"when":[35],"pulled":[36],"back":[37],"P/poly":[39,59],"maps":[40],"to":[41,45,126,160],"a":[42,46,58,77,81,89,97,117,120,128,134,147,151,155],"bigger":[43],"or":[44,115],"smaller":[47],"universe.":[48],"In":[49],"particular,":[50],"we":[51,141],"prove":[52],"that:":[53],"1.":[54],"If":[55],"there":[56],"exists":[57],"map":[60],"g":[61,85],":":[62],"\u2192":[66],"m":[69,73,130,138],",":[70,74],"<":[72],"iterable":[75],"for":[76,104],"proof":[78,106,144,171],"system":[79],"then":[80],"tautology":[82,149],"(independent":[83],"expressing":[87],"that":[88],"particular":[90],"set":[93],"is":[94,102],"dominating":[95],"in":[96,119,133,157,169],"2":[99,136,137],"tournament":[101],"hard":[103],"system.":[107],"2.":[108],"The":[109],"search":[110],"problem":[111],"WPHP.":[112],"decoding":[113],"RSA":[114],"finding":[116,127],"collision":[118],"hashing":[121],"function":[122],"can":[123],"be":[124],"reduced":[125],"homogeneous":[131],"subgraph":[132],"graph.":[139],"Further":[140],"reduce":[142],"complexity":[145,162],"concrete":[148],"(expressing":[150],"Ramsey":[152],"property":[153],"graph)":[156],"strong":[158],"systems":[159],"implicit":[164,167],"proofs":[165],"formulas":[168],"weak":[170],"systems.":[172]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":28},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}