{"id":"https://openalex.org/W2127113976","doi":"https://doi.org/10.1137/s0097539795286612","title":"On Syntactic versus Computational Views of Approximability","display_name":"On Syntactic versus Computational Views of Approximability","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2127113976","doi":"https://doi.org/10.1137/s0097539795286612","mag":"2127113976"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795286612","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795286612","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112649653","display_name":"Rajeev Motwani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajeev Motwani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071039750","display_name":"Umesh Vazirani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Umesh Vazirani","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039619350"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9817,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7758494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"28","issue":"1","first_page":"164","last_page":"191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9824000000953674,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9824000000953674,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.978600025177002,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9697999954223633,"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/simple","display_name":"Simple (philosophy)","score":0.5962302088737488},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5697544813156128},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.566943883895874},{"id":"https://openalex.org/keywords/computational-problem","display_name":"Computational problem","score":0.5153176784515381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5103122591972351},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5034493803977966},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.49475210905075073},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47438839077949524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4596514105796814},{"id":"https://openalex.org/keywords/apx","display_name":"APX","score":0.4294048547744751},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4130708575248718},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40860098600387573},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3574194312095642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3341723680496216},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30540573596954346}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5962302088737488},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5697544813156128},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.566943883895874},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.5153176784515381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5103122591972351},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5034493803977966},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.49475210905075073},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47438839077949524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4596514105796814},{"id":"https://openalex.org/C130698151","wikidata":"https://www.wikidata.org/wiki/Q4653447","display_name":"APX","level":4,"score":0.4294048547744751},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4130708575248718},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40860098600387573},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3574194312095642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3341723680496216},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30540573596954346},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C181199279","wikidata":"https://www.wikidata.org/wiki/Q8047","display_name":"Enzyme","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162008176","wikidata":"https://www.wikidata.org/wiki/Q419305","display_name":"Peroxidase","level":3,"score":0.0}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1137/s0097539795286612","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795286612","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:CiteSeerX.psu:10.1.1.115.4301","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.4301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csdl.computer.org/comp/proceedings/sfcs/1994/6580/00/0365712.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.172.7605","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.7605","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.csail.mit.edu/%7Emadhu/papers/1994/kmsv-conf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.8090","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.8090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.lcs.mit.edu/~madhu/papers/kmsv-journ.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.4460","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.4460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.lcs.mit.edu/~madhu/papers/kmsv-conf.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.4635","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.4635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/madhu/papers/1994/kmsv-journ.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.40.4552","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.4552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~cisfac/sanjeev/postscript/focs94.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.1961","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.1961","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.informatik.uni-trier.de/pub/Users-CTVD/eccc/reports/1995/TR95-023/Paper.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.966","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.966","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/people/motwani/postscripts/syntax.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.2849","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.2849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1995/TR95-023/Paper.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.2005","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.2005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/eccc-reports/1995/TR95-023/Paper.pdf","raw_type":"text"},{"id":"mag:2127113976","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc2.html#ECCC-TR95-023","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1972345639","https://openalex.org/W1975220965","https://openalex.org/W1976960787","https://openalex.org/W2015101476","https://openalex.org/W2038225707","https://openalex.org/W2059453880","https://openalex.org/W2077783414","https://openalex.org/W2082160108","https://openalex.org/W2141355868"],"related_works":["https://openalex.org/W2038225707","https://openalex.org/W2085485381","https://openalex.org/W2950292965","https://openalex.org/W2567924388","https://openalex.org/W2077543835","https://openalex.org/W2291046003","https://openalex.org/W2122027179","https://openalex.org/W2066979869","https://openalex.org/W2982304552","https://openalex.org/W808328477","https://openalex.org/W2964184813","https://openalex.org/W2506600720","https://openalex.org/W2397920857","https://openalex.org/W2255082502","https://openalex.org/W2149577432","https://openalex.org/W561119072","https://openalex.org/W2898913421","https://openalex.org/W1500586414","https://openalex.org/W3106613142","https://openalex.org/W2766740319"],"abstract_inverted_index":{"We":[0,63,147,211,227,243],"attempt":[1],"to":[2,35,91,122,128,130,157,201,216,261],"reconcilethe":[3],"two":[4],"distinct":[5],"views":[6],"of":[7,39,52,151,184,224,268,285],"approximation":[8,203,241,258,286],"classes:":[9],"syntactic":[10,50,61,182,222],"and":[11,22,55,77,164,172,191,288],"computational.":[12],"Syntactic":[13],"classes":[14,29,38,54,159],"such":[15,30,160,246],"as":[16,31,161,178],"MAX":[17,69,95,144,162,185,225,254,270],"SNP":[18,70,186,255],"permit":[19],"structural":[20],"results":[21,47,142],"have":[23,168],"natural":[24],"complete":[25,179],"problems,":[26,256],"while":[27],"computational":[28,53,58],"APX":[32,76,83],"allow":[33],"us":[34],"work":[36],"with":[37,71],"problems":[40],"whose":[41],"approximability":[42],"is":[43,126],"well":[44],"understood.":[45],"Our":[46,97],"provide":[48,202,212],"a":[49,57,92,100,123,229,266],"characterization":[51],"give":[56],"framework":[59],"for":[60,105,143,205,236,252,265],"classes.":[62],"compare":[64],"the":[65,72,139,149,169,173,209,221,262,283,289],"syntactically":[66],"defined":[67,74],"class":[68,75],"computationally":[73],"show":[78,244],"that":[79,111,245],"every":[80,206],"problem":[81,114,124,171,207],"in":[82,94,118,208,281],"can":[84,115,248],"be":[85,116],"\"placed\"":[86],"(i.e.,":[87],"has":[88],"approximation-preserving":[89,107,120],"reduction":[90,134],"problem)":[93],"SNP.":[96,226],"methods":[98],"introduce":[99],"simple,":[101],"yet":[102,239],"general,":[103],"technique":[104,153],"creating":[106],"reductions":[108],"which":[109,125,167],"shows":[110],"any":[112],"\"well\"-approximable":[113],"reduced":[117],"an":[119,213],"manner":[121],"hard":[127],"approximate":[129],"corresponding":[131],"factors.":[132],"The":[133,181],"then":[135],"follows":[136],"easily":[137],"from":[138],"recent":[140],"nonapproximability":[141],"SNP-hard":[145,271],"problems.":[146,180,272],"demonstrate":[148],"generality":[150],"this":[152,218],"by":[154,189],"applying":[155],"it":[156],"other":[158],"SNP-RMAX(2)":[163],"MIN":[165],"F$^{+}\\Pi_2(1)$":[166],"clique":[170],"set":[174],"cover":[175],"problem,":[176],"respectively,":[177],"nature":[183,223],"was":[187],"used":[188],"Papadimitriou":[190],"Yannakakis":[192],"[J.":[193],"Comput.":[194],"System":[195],"Sci.,":[196],"43":[197],"(1991),":[198],"pp.":[199],"425--440]":[200],"algorithms":[204,247],"class.":[210],"alternate":[214],"approach":[215],"demonstrating":[217],"result":[219],"using":[220],"develop":[228],"general":[230],"paradigm,":[231],"nonoblivious":[232],"local":[233,274,279],"search,":[234],"useful":[235],"developing":[237],"simple":[238],"efficient":[240],"algorithms.":[242,293],"find":[249],"good":[250],"approximations":[251],"all":[253],"yielding":[257],"ratios":[259],"comparable":[260],"best":[263],"known":[264],"variety":[267],"specific":[269],"Nonoblivious":[273],"search":[275,280],"provably":[276],"outperforms":[277],"standard":[278],"both":[282],"degree":[284],"achieved":[287],"efficiency":[290],"ofthe":[291],"resulting":[292]},"counts_by_year":[{"year":2013,"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"}