{"id":"https://openalex.org/W48693379","doi":"https://doi.org/10.1109/psct.1987.10319251","title":"A Structural Theorem that Depends Quantitatively on the Complexity of SAT","display_name":"A Structural Theorem that Depends Quantitatively on the Complexity of SAT","alternate_titles":[],"publication_year":1987,"publication_date":"1987-06-01","ids":{"openalex":"https://openalex.org/W48693379","doi":"https://doi.org/10.1109/psct.1987.10319251","mag":"48693379"},"language":"en","primary_location":{"id":"doi:10.1109/psct.1987.10319251","doi":"https://doi.org/10.1109/psct.1987.10319251","is_oa":false,"landing_page_url":"https://doi.org/10.1109/psct.1987.10319251","pdf_url":null,"source":{"id":"https://openalex.org/S4210204929","display_name":"IEEE Conference on Computational Complexity (CCC)","issn_l":"1093-0159","issn":["1093-0159","2575-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceeding Structure in Complexity Theory","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W48693379"],"child_works_count":0,"type":"conference-paper","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/A5078715930","display_name":"Richard Beigel","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Richard Beigel","raw_affiliation_strings":["Department of Computer Science, The Johns Hopkins University, Baltimore, MD 21218"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Johns Hopkins University, Baltimore, MD 21218","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078715930"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":1.8776,"has_fulltext":false,"cited_by_count":44,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.82638889,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"28","last_page":"32"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.5396000146865845,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.5396000146865845,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4359999895095825,"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.011900000274181366,"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/oracle-queries","display_name":"oracle queries","score":0.9190000295639038},{"id":"https://openalex.org/keywords/pnp","display_name":"PNP","score":0.5429999828338623},{"id":"https://openalex.org/keywords/oracle-complexity","display_name":"oracle complexity","score":0.4880000054836273},{"id":"https://openalex.org/keywords/structure-theorem","display_name":"structure theorem","score":0.36000001430511475}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.9255903959274292},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.636336088180542},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6346408128738403},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5373783111572266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.522621214389801},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.49875664710998535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.498335599899292},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47813665866851807},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.4755411148071289},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4537113904953003},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4170057773590088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3891957402229309},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36474132537841797},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.364159494638443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1936698853969574},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07497727870941162},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/psct.1987.10319251","doi":"https://doi.org/10.1109/psct.1987.10319251","is_oa":false,"landing_page_url":"https://doi.org/10.1109/psct.1987.10319251","pdf_url":null,"source":{"id":"https://openalex.org/S4210204929","display_name":"IEEE Conference on Computational Complexity (CCC)","issn_l":"1093-0159","issn":["1093-0159","2575-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceeding Structure in Complexity Theory","raw_type":"proceedings-article"}],"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/W2063158069","https://openalex.org/W1923467074","https://openalex.org/W2300174248","https://openalex.org/W2153278832","https://openalex.org/W189098498","https://openalex.org/W2461428748","https://openalex.org/W2293902648","https://openalex.org/W7099151020","https://openalex.org/W2136500328","https://openalex.org/W3196479704"],"abstract_inverted_index":{"We":[0,27,69,91],"consider":[1,93],"the":[2,40,48,64,85,94,114,133,215],"class":[3,127,134],"of":[4,14,25,57,63,66,74,79,88,96,98,116,128,135,151,164,217],"functions":[5,38,80],"that":[6,51,81,119,139,160,189,194],"can":[7,140,181],"be":[8,141],"computed":[9],"with":[10,146,183],"a":[11,17,22,67,71,77,111,123,154,167,185,198],"bounded":[12,23],"number":[13,115,150,163],"queries":[15,31,118,152,165,196],"to":[16,34,50,83,121,153,166,174,188,197,204],"given":[18],"oracle":[19,89,117,169,200],"A,":[20],"in":[21,104,143],"amount":[24],"time.":[26],"ask":[28],"whether":[29],"additional":[30,195],"allow":[32,172,202],"us":[33,173,203],"compute":[35,122,205],"strictly":[36,206],"more":[37,176,207],"within":[39],"same":[41],"time":[42,145],"bound.":[43],"For":[44],"almost":[45],"all":[46,136],"oracles,":[47],"answer":[49],"question":[52],"is":[53,59,130,158],"yes;":[54],"thus":[55],"\"number":[56],"queries\"":[58],"an":[60,99,147,161],"important":[61,126],"measure":[62],"complexity":[65,216],"function.":[68,124],"define":[70],"new":[72],"notion":[73,95],"computability":[75],"by":[76],"set":[78],"seems":[82],"capture":[84],"information-theoretic":[86],"aspects":[87],"computations.":[90],"also":[92],"terseness":[97],"oracle,":[100],"which":[101],"originally":[102],"appeared":[103],"[BGGO86].":[105],"Combining":[106],"these":[107],"two":[108],"notions":[109],"yields":[110],"theorem":[112],"about":[113,214],"suffice":[120],"An":[125],"problems":[129,138,178],"\u0394$_\\text{2}^\\text{P}$(i.e.,":[131],"PNP,":[132],"decision":[137,177],"solved":[142],"polynomial":[144],"otherwise":[148],"unbounded":[149,162],"SAT":[155],"oracle).":[156],"It":[157],"known":[159],"\u0394$_\\text{2}^\\text{P}$complete":[168,199],"do":[170,201],"not":[171],"solve":[175,182],"than":[179],"we":[180,192,210],"just":[184],"single":[186],"query":[187],"oracle.":[190],"However,":[191],"show":[193],"functions,":[208],"if":[209],"make":[211],"appropriate":[212],"assumptions":[213],"SAT.":[218]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W48693379","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
