乐胖代购免代理版

{"id":"https://openalex.org/W2165641429","doi":"https://doi.org/10.1109/sct.1994.315789","title":"Generalized CNF satisfiability problems and non-efficient approximability","display_name":"Generalized CNF satisfiability problems and non-efficient approximability","publication_year":2002,"publication_date":"2002-12-17","ids":{"openalex":"https://openalex.org/W2165641429","doi":"https://doi.org/10.1109/sct.1994.315789","mag":"2165641429"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sct.1994.315789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5086835651","display_name":"Harry B. Hunt","orcid":null},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"funder","lineage":["https://openalex.org/I392282"]},{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H.B. Hunt","raw_affiliation_strings":["Department of Computer Science, State University of New York, Albany, Albany, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, Albany, Albany, NY, USA","institution_ids":["https://openalex.org/I392282","https://openalex.org/I113508548"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020293284","display_name":"Madhav Marathe","orcid":"https://orcid.org/0000-0003-1653-0658"},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"funder","lineage":["https://openalex.org/I392282"]},{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.V. Marathe","raw_affiliation_strings":["Department of Computer Science, State University of New York, Albany, Albany, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, Albany, Albany, NY, USA","institution_ids":["https://openalex.org/I392282","https://openalex.org/I113508548"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052202085","display_name":"Richard E. Stearns","orcid":"https://orcid.org/0000-0001-5058-1999"},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"funder","lineage":["https://openalex.org/I392282"]},{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R.E. Stearns","raw_affiliation_strings":["Department of Computer Science, State University of New York, Albany, Albany, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, Albany, Albany, NY, USA","institution_ids":["https://openalex.org/I392282","https://openalex.org/I113508548"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.766,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":15,"citation_normalized_percentile":{"value":0.236222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":83,"max":84},"biblio":{"volume":null,"issue":null,"first_page":"356","last_page":"366"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9996,"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.9996,"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.9993,"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.9987,"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/treewidth","display_name":"Treewidth","score":0.7878673},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.67011577},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5942678},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4858203},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.41520217}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7878673},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.74595827},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.67011577},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6249742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.59645563},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5942678},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.55014974},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.54331243},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5356009},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.53530055},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4858203},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.45367312},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.41520217},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4087653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27026936},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.18157166},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13054922},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sct.1994.315789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":30,"referenced_works":["https://openalex.org/W1496408413","https://openalex.org/W1527768578","https://openalex.org/W1557755441","https://openalex.org/W1596636045","https://openalex.org/W1605991832","https://openalex.org/W1968653910","https://openalex.org/W1971821372","https://openalex.org/W2011039300","https://openalex.org/W2015092796","https://openalex.org/W2019482147","https://openalex.org/W2019578639","https://openalex.org/W2021380921","https://openalex.org/W2030312085","https://openalex.org/W2032278512","https://openalex.org/W2038225707","https://openalex.org/W2042654457","https://openalex.org/W2053439155","https://openalex.org/W2064796716","https://openalex.org/W2066577300","https://openalex.org/W2071016718","https://openalex.org/W2079473728","https://openalex.org/W2082160108","https://openalex.org/W2096131896","https://openalex.org/W2132258126","https://openalex.org/W2138820476","https://openalex.org/W2143391442","https://openalex.org/W2143406303","https://openalex.org/W2152221184","https://openalex.org/W2166566648","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W53412747","https://openalex.org/W4385438527","https://openalex.org/W4293169752","https://openalex.org/W3107131366","https://openalex.org/W2963205836","https://openalex.org/W2767684567","https://openalex.org/W2165641429","https://openalex.org/W2067983896","https://openalex.org/W1560318357","https://openalex.org/W138251527"],"abstract_inverted_index":{"We":[0],"use":[1,43],"variants":[2,90],"of":[3,10,19,22,39,44,49,67,89,91],"the":[4,16,30,35,68,92],"generalized":[5],"CNF":[6],"satisfiability":[7],"problems":[8,28,70,93],"SAT(S)":[9],"T.J.":[11],"Schhaefer":[12],"(1978)":[13],"to":[14,73,81,122,141],"characterize":[15],"efficient":[17],"approximability":[18],"a":[20,65],"number":[21,66],"basic":[23],"NP":[24],"and":[25,96,116],"PSPACE-hard":[26],"optimization":[27,69],"in":[29],"literature.":[31],"In":[32,54],"contrast":[33],"with":[34],"recent":[36],"results,":[37],"none":[38],"our":[40],"proofs":[41],"make":[42],"interactive":[45],"proof":[46],"systems":[47],"or":[48,59],"probabilistically":[50],"checkable":[51],"debate":[52],"systems.":[53],"particular":[55],"assuming":[56],"P/spl":[57,60],"ne/NP-":[58],"ne/PSPACE,":[61],"we":[62,101,125],"show":[63,102,126],"that":[64,138],"shown":[71,79],"not":[72,80,104],"be":[74,78,82],"efficiently":[75,83],"approximable":[76,84],"can":[77],"by":[85],"direct":[86],"reductions,":[87],"often":[88,100],"MAX":[94],"NSF":[95],"ambiguous":[97],"3SAT.":[98],"Moreover,":[99],"this,":[103],"only":[105],"for":[106,112,117],"arbitrary":[107],"problem":[108,114],"instances":[109,115],"but":[110],"also":[111,135],"planar":[113,131],"f(n)-treewidth-bounded":[118],"instances.":[119],"Thus":[120],"analogous":[121],"Zuckerman":[123],"(1993),":[124],"that:":[127],"\"Planar":[128],"NP-complete,":[129],"PSPACE-complete,":[130],"PSPACE-complete":[132],"problems,":[133],"etc.":[134],"have":[136],"versions":[137],"are":[139],"hard":[140],"approximate\".<":[142],">":[145]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2165641429","counts_by_year":[],"updated_date":"2025-02-23T18:53:23.869068","created_date":"2016-06-24"}