{"id":"https://openalex.org/W1967415230","doi":"https://doi.org/10.1137/s0097539792228289","title":"The Complexity of Decision Versus Search","display_name":"The Complexity of Decision Versus Search","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W1967415230","doi":"https://doi.org/10.1137/s0097539792228289","mag":"1967415230"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792228289","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792228289","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.mit.edu/bitstream/1721.1/149172/1/MIT-LCS-TM-444.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033480276","display_name":"Mihir Bellare","orcid":"https://orcid.org/0000-0002-8765-5573"},"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":true,"raw_author_name":"Mihir Bellare","raw_affiliation_strings":["University of California,  San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,  San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110776230","display_name":"Shafi Goldwasser","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shafi Goldwasser","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033480276"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":6.0299,"has_fulltext":true,"cited_by_count":71,"citation_normalized_percentile":{"value":0.97027557,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"23","issue":"1","first_page":"97","last_page":"119"},"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.9998000264167786,"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.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987000226974487,"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/np","display_name":"NP","score":0.8619382977485657},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8475456237792969},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.664777934551239},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6497509479522705},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5257245898246765},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5089328289031982},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5079663395881653},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.5040094256401062},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49060574173927307},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.44572320580482483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42558377981185913},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33969736099243164},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23526635766029358},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.15055477619171143}],"concepts":[{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.8619382977485657},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8475456237792969},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.664777934551239},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6497509479522705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5257245898246765},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5089328289031982},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5079663395881653},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.5040094256401062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49060574173927307},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.44572320580482483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42558377981185913},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33969736099243164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23526635766029358},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.15055477619171143},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","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":6,"locations":[{"id":"doi:10.1137/s0097539792228289","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792228289","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/149172","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149172","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/149172/1/MIT-LCS-TM-444.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.4445","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.4445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsd.edu/users/mihir/papers/compip.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.1109","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.1109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lcs.mit.edu/publications/pubs/ps/MIT-LCS-TM-444.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.5516","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.5516","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TM-444.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.3063","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.3063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cse.ucsd.edu/users/mihir/papers/compip.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/149172","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149172","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/149172/1/MIT-LCS-TM-444.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G5204990901","display_name":"The Crucial Ingredients for Cryptographic Protocols","funder_award_id":"8719689","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1967415230.pdf"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1519465599","https://openalex.org/W1576806492","https://openalex.org/W1593353904","https://openalex.org/W1630273691","https://openalex.org/W1970606468","https://openalex.org/W1971070826","https://openalex.org/W1979549874","https://openalex.org/W2002032317","https://openalex.org/W2005390858","https://openalex.org/W2010699490","https://openalex.org/W2011112377","https://openalex.org/W2036265926","https://openalex.org/W2036878936","https://openalex.org/W2052936500","https://openalex.org/W2057182494","https://openalex.org/W2084732248","https://openalex.org/W2090841650","https://openalex.org/W2100570449","https://openalex.org/W2113244484","https://openalex.org/W2173249896","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W2098066196","https://openalex.org/W1523547988","https://openalex.org/W3126743327","https://openalex.org/W1629505938","https://openalex.org/W1967415230","https://openalex.org/W1506378440","https://openalex.org/W2400283444","https://openalex.org/W2001699096","https://openalex.org/W2267494348","https://openalex.org/W2282170612"],"abstract_inverted_index":{"A":[0],"basic":[1],"question":[2],"about":[3],"NP":[4,39,71,91],"is":[5,22,48,75,83],"whether":[6],"or":[7],"not":[8,44,94],"search":[9,42],"reduces":[10],"in":[11,38,53,70,90],"polynomial":[12],"time":[13,33],"to":[14,46,57,77,84],"decision.":[15],"This":[16],"paper":[17],"indicates":[18],"that":[19,92],"the":[20,66],"answer":[21],"negative:":[23],"Under":[24,63],"a":[25,36,54],"complexity":[26],"assumption":[27],"(that":[28],"deterministic":[29],"and":[30,60,88],"nondeterministic":[31],"double-exponential":[32],"are":[34,93],"unequal)":[35],"language":[37],"for":[40,72],"which":[41,73],"does":[43],"reduce":[45],"decision":[47],"constructed.":[49],"These":[50],"ideas":[51],"extend":[52],"natural":[55],"way":[56],"interactive":[58],"proofs":[59],"program":[61],"checking.":[62],"similar":[64],"assumptions,":[65],"authors":[67],"present":[68],"languages":[69,89],"it":[74,82],"harder":[76],"prove":[78],"membership":[79],"interactively":[80],"than":[81],"decide":[85],"this":[86],"membership,":[87],"checkable.":[95]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}