{"id":"https://openalex.org/W314996113","doi":"https://doi.org/10.1109/ccc.2004.1313795","title":"Relativized NP search problems and propositional proof systems","display_name":"Relativized NP search problems and propositional proof systems","publication_year":2004,"publication_date":"2004-11-13","ids":{"openalex":"https://openalex.org/W314996113","doi":"https://doi.org/10.1109/ccc.2004.1313795","mag":"314996113"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2004.1313795","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2004.1313795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","raw_type":"proceedings-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/A5111441480","display_name":"J. Buresh-Oppenheim","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J. Buresh-Oppenheim","raw_affiliation_strings":["University of Toronto, Canada","Toronto Univ., Ont., Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Toronto Univ., Ont., Canada","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030206786","display_name":"Tsuyoshi Morioka","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"T. Morioka","raw_affiliation_strings":["University of Toronto, Canada","Toronto Univ., Ont., Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Toronto Univ., Ont., Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111441480"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.8994,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.79450903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"54","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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/propositional-calculus","display_name":"Propositional calculus","score":0.5859665274620056},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5575074553489685},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49455496668815613},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.44208672642707825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3885706663131714},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35646241903305054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2741665244102478},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.07875463366508484},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.05483981966972351}],"concepts":[{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.5859665274620056},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5575074553489685},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49455496668815613},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.44208672642707825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3885706663131714},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35646241903305054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2741665244102478},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.07875463366508484},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.05483981966972351},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccc.2004.1313795","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2004.1313795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W9698083","https://openalex.org/W25235941","https://openalex.org/W32283539","https://openalex.org/W64175367","https://openalex.org/W99342914","https://openalex.org/W1572440476","https://openalex.org/W1972416792","https://openalex.org/W1980813953","https://openalex.org/W1982248598","https://openalex.org/W1983668094","https://openalex.org/W1993138363","https://openalex.org/W2026967932","https://openalex.org/W2029390834","https://openalex.org/W2035926913","https://openalex.org/W2037028865","https://openalex.org/W2044095368","https://openalex.org/W2056827464","https://openalex.org/W2093396771","https://openalex.org/W2093400121","https://openalex.org/W2095226356","https://openalex.org/W2103981148","https://openalex.org/W2132489129","https://openalex.org/W2133313069","https://openalex.org/W2139730493","https://openalex.org/W2163996090","https://openalex.org/W2169359757","https://openalex.org/W2169713712","https://openalex.org/W2726059329","https://openalex.org/W4213009134","https://openalex.org/W4248733413","https://openalex.org/W4388289489","https://openalex.org/W6601034832","https://openalex.org/W6602600941","https://openalex.org/W6634525871","https://openalex.org/W6814843278"],"related_works":["https://openalex.org/W2990043628","https://openalex.org/W1987118140","https://openalex.org/W1512746455","https://openalex.org/W949976107","https://openalex.org/W2788816388","https://openalex.org/W1834198313","https://openalex.org/W770516323","https://openalex.org/W1535347767","https://openalex.org/W20075351","https://openalex.org/W2753667555"],"abstract_inverted_index":{"An":[0],"NP":[1,14,23],"search":[2,24,44,94],"problem":[3,6],"is":[4,18,38,64,72],"the":[5,19,39,51,56,65,75,97,103,118],"of":[7,21,30,41,58,67,107],"finding":[8],"a":[9,12,28,59,85],"witness":[10],"to":[11,128],"given":[13],"predicate,":[15],"and":[16,96,123,136,142],"TFNP":[17,26],"class":[20,40,66],"total":[22],"problems.":[25],"contains":[27],"number":[29],"subclasses":[31],"containing":[32],"natural":[33],"problems;":[34],"for":[35,61],"example,":[36,62],"PLS":[37,63],"efficient":[42],"local":[43],"heuristics.":[45],"These":[46,111],"classes":[47,95,138],"are":[48],"characterized":[49],"by":[50,74],"combinatorial":[52],"principle":[53,76],"that":[54],"guarantees":[55],"existence":[57],"solution;":[60],"such":[68],"problems":[69],"whose":[70],"totality":[71],"assured":[73],"\"every":[77],"dag":[78],"with":[79,114],"at":[80],"least":[81],"one":[82],"edge":[83],"has":[84],"sink\".":[86],"We":[87],"show":[88],"many":[89],"strong":[90],"connections":[91],"between":[92],"these":[93],"computational":[98],"power":[99],"-":[100,106],"in":[101,117],"particular":[102],"proof":[104,120],"complexity":[105],"their":[108],"underlying":[109],"principles.":[110],"connections,":[112],"along":[113],"lower":[115],"bounds":[116],"propositional":[119],"systems":[121],"Nullstellensatz":[122],"bounded-depth":[124],"LK,":[125],"allow":[126],"us":[127],"prove":[129],"several":[130],"new":[131],"relative":[132],"separations":[133],"among":[134],"PLS,":[135],"Papadimitriou's":[137],"PPP,":[139],"PPA,":[140],"PPAD,":[141],"PPADS.":[143]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}