{"id":"https://openalex.org/W2063416709","doi":"https://doi.org/10.1145/225058.225147","title":"The relative complexity of NP search problems","display_name":"The relative complexity of NP search problems","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2063416709","doi":"https://doi.org/10.1145/225058.225147","mag":"2063416709"},"language":"en","primary_location":{"id":"doi:10.1145/225058.225147","is_oa":false,"landing_page_url":"https://doi.org/10.1145/225058.225147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh annual ACM symposium on Theory of computing  - STOC '95","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/A5042076941","display_name":"Paul Beame","orcid":"https://orcid.org/0000-0002-2666-3545"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Beame","raw_affiliation_strings":["Computer Science and Engineering - University of Washington"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering - University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034555443","display_name":"Stephen Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]},{"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","FR"],"is_corresponding":false,"raw_author_name":"Stephen Cook","raw_affiliation_strings":["Computer Science Department, University of Toronto"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Toronto","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110260911","display_name":"Jeff Edmonds","orcid":null},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jeff Edmonds","raw_affiliation_strings":["Department of Computer Science, York University, Toronto, Ontario, Canada, M3J 1P3f3E-mail: jeff@cs.yorku.caf3#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, York University, Toronto, Ontario, Canada, M3J 1P3f3E-mail: jeff@cs.yorku.caf3#TAB#","institution_ids":["https://openalex.org/I192455969"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002208831","display_name":"Russell Impagliazzo","orcid":"https://orcid.org/0000-0003-3236-9796"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Russell Impagliazzo","raw_affiliation_strings":["Computer Science Dept., UCSD#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept., UCSD#TAB#","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":["Mathematics and Computer Science, University of Pittsburgh"],"affiliations":[{"raw_affiliation_string":"Mathematics and Computer Science, University of Pittsburgh","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5042076941"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":4.0509,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.93891568,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"303","last_page":"314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9977999925613403,"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/T11269","display_name":"Algorithms and Data Compression","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5181021094322205},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41868042945861816},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.41028642654418945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3524170219898224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2235845923423767}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5181021094322205},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41868042945861816},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.41028642654418945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3524170219898224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2235845923423767}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/225058.225147","is_oa":false,"landing_page_url":"https://doi.org/10.1145/225058.225147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh annual ACM symposium on Theory of computing  - STOC '95","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1077472201","display_name":"Computational Complexity Lower Bounds","funder_award_id":"9303017","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4196301069","display_name":"PYI: Resource Bounds and Parallel Computation.","funder_award_id":"8858799","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G887311807","display_name":"NSF Young Investigator:  Logic and Complexity Theory","funder_award_id":"9457782","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320330380","display_name":"Information Technology Research Centre","ror":null},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W167630282","https://openalex.org/W1496913341","https://openalex.org/W1960909089","https://openalex.org/W1972416792","https://openalex.org/W1983668094","https://openalex.org/W2040194491","https://openalex.org/W2045664183","https://openalex.org/W2084732248","https://openalex.org/W2093400121","https://openalex.org/W2094321606","https://openalex.org/W2103981148","https://openalex.org/W2106380698","https://openalex.org/W2130864840","https://openalex.org/W2169359757","https://openalex.org/W2323554188","https://openalex.org/W4236676762","https://openalex.org/W4241584151"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2810583502"],"abstract_inverted_index":{"Papadimitriou":[0],"introduced":[1],"several":[2,58],"classes":[3,70,120],"of":[4,16,40,48,52,82,113,133],"NP":[5],"search":[6,22,54,69,78],"problems":[7,23],"based":[8],"on":[9,117,130],"combinatorial":[10,106,115],"principles":[11,116],"which":[12,60,118],"guarantee":[13],"the":[14,19,46,49,68,111,114,119,131],"existence":[15],"solutions":[17],"to":[18,26,89,110,136],"problems.Many":[20],"interesting":[21,105],"not":[24,86],"known":[25],"be":[27],"solvable":[28],"in":[29,34,63,80],"polynomial":[30],"time":[31],"are":[32,42,71,121],"contained":[33],"these":[35,53],"classes,":[36],"and":[37,73,108],"a":[38,64,76],"number":[39],"them":[41,83],"complete":[43],"problems.We":[44],"consider":[45],"question":[47],"relative":[50],"complexity":[51],"problem":[55,79],"classes.We":[56],"prove":[57],"separations":[59,94],"show":[61],"that":[62,84,97],"generic":[65],"relativized":[66],"world,":[67],"distinct":[72],"there":[74],"is":[75,85],"standard":[77],"each":[81],"computationally":[87],"equivalent":[88],"any":[90],"decision":[91],"problem.(Naturally,":[92],"absolute":[93],"would":[95],"imply":[96],"P":[98],"6":[99],"=":[100],"NP.)Our":[101],"separation":[102],"proofs":[103],"have":[104],"content":[107],"go":[109],"heart":[112],"based.We":[122],"derive":[123],"one":[124],"result":[125],"via":[126],"new":[127],"lower":[128],"bounds":[129],"degrees":[132],"polynomials":[134],"asserted":[135],"exist":[137],"by":[138],"Hilbert's":[139],"Nullstellensatz":[140],"over":[141],"nite":[142],"elds.":[143]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}