{"id":"https://openalex.org/W2015092796","doi":"https://doi.org/10.1145/100216.100275","title":"Quantifiers and approximation","display_name":"Quantifiers and approximation","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2015092796","doi":"https://doi.org/10.1145/100216.100275","mag":"2015092796"},"language":"en","primary_location":{"id":"doi:10.1145/100216.100275","doi":"https://doi.org/10.1145/100216.100275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100275","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100275","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063633119","display_name":"Alessandro Panconesi","orcid":"https://orcid.org/0000-0002-2169-3067","observed_orcids":["https://orcid.org/0000-0002-2169-3067"]},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Panconesi","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, NY","Dept. of Computer Science, Cornell University, Ithaca NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, NY","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Dept. of Computer Science, Cornell University, Ithaca NY","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109076888","display_name":"Desh Ranjan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Ranjan","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, NY","Dept. of Computer Science, Cornell University, Ithaca NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, NY","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Dept. of Computer Science, Cornell University, Ithaca NY","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":3.6957,"has_fulltext":true,"cited_by_count":41,"citation_normalized_percentile":{"value":0.94027778,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"446","last_page":"456"},"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.9872999787330627,"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.9872999787330627,"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.011800000444054604,"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":9.999999747378752e-05,"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/approximation-preserving-reductions","display_name":"approximation-preserving reductions","score":0.6129999756813049},{"id":"https://openalex.org/keywords/np-optimization-problems","display_name":"NP optimization problems","score":0.8080000281333923},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.5149999856948853},{"id":"https://openalex.org/keywords/complexity-classes","display_name":"complexity classes","score":0.49900001287460327},{"id":"https://openalex.org/keywords/quantifiers","display_name":"quantifiers","score":0.4480000138282776}],"concepts":[{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.800798773765564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5559240579605103},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.4885898232460022}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/100216.100275","doi":"https://doi.org/10.1145/100216.100275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100275","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/100216.100275","doi":"https://doi.org/10.1145/100216.100275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/100216.100275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/100216.100275","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G709144585","display_name":"Structural Computational Complexity","funder_award_id":"8823053","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2015092796.pdf","grobid_xml":"https://content.openalex.org/works/W2015092796.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1608772366","https://openalex.org/W1636637297","https://openalex.org/W2011039300","https://openalex.org/W2025904765","https://openalex.org/W2040579873","https://openalex.org/W2040924621","https://openalex.org/W2053548601","https://openalex.org/W2072181151","https://openalex.org/W2093979815"],"related_works":["https://openalex.org/W2040579873","https://openalex.org/W2095782926","https://openalex.org/W7099433456","https://openalex.org/W1972345639","https://openalex.org/W2390999836","https://openalex.org/W136913846","https://openalex.org/W1992720234","https://openalex.org/W2116940701","https://openalex.org/W2911460745","https://openalex.org/W234224109"],"abstract_inverted_index":{"We":[0],"investigate":[1],"tile":[2],"relationship":[3],"between":[4],"logical":[5],"expressibility":[6],"of":[7,27,102,104],"NP":[8,43],"optimization":[9,36,79,148],"problems":[10,29,37,50,59,80,91,110,128,149],"and":[11,21,44,129,145],"their":[12],"approximation":[13],"properties.First":[14],"sucll":[15],"attempt":[16],"was":[17],"made":[18],"by":[19],"Papadimitriou":[20],"Yannakakis,":[22],"who":[23],"defined":[24],"the":[25,100,120],"class":[26,69,121],"NPO":[28],"MAX":[30,42,73,84,105,132,143],"NP.We":[31],"show":[32],"that":[33,45,60,70,76,107,122,134,142],"many":[34],"importaut":[35],"do":[38],"not":[39,55,136],"belong":[40],"to":[41,117,138],"in":[46,51,65],"fact":[47],"there":[48],"are":[49,54,81,92,112,135,150],"P":[52,96],"which":[53,111],"ill":[56],"lk'IAX":[57],"NP.The":[58],"we":[61,71,123],"consider":[62],"fit":[63],"naturally":[64],"a":[66],"new":[67],"complexity":[68],"call":[72,124],"Ill.We":[74],"prove":[75,141],"several":[77,146],"natural":[78],"complete":[82,90,151],"for":[83,152],"H1":[85],"under":[86],"approxima.tionpreserving":[87],"reductions.All":[88],"these":[89],"non":[93],"approximable":[94,127],"unless":[95],"\u00a2":[97],"NP.This":[98],"motivates":[99],"definition":[101],"subclasses":[103],"II1":[106],"only":[108],"contain":[109],"presumably":[113],"easier":[114],"with":[115],"respect":[116],"approximation.In":[118],"particular,":[119],"RMAX(2),":[125],"contains":[126],"prob-]elllS":[130],"like":[131],"CLIQUE":[133,144],"known":[137],"be":[139],"nonapproximable.We":[140],"other":[147],"RMAX(2).":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}