{"id":"https://openalex.org/W2152196641","doi":"https://doi.org/10.1109/lics.1994.316065","title":"A syntactic characterization of NP-completeness","display_name":"A syntactic characterization of NP-completeness","alternate_titles":[],"publication_year":2002,"publication_date":"2002-12-17","ids":{"openalex":"https://openalex.org/W2152196641","doi":"https://doi.org/10.1109/lics.1994.316065","mag":"2152196641"},"language":"en","primary_location":{"id":"doi:10.1109/lics.1994.316065","doi":"https://doi.org/10.1109/lics.1994.316065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.1994.316065","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","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":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2152196641"],"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":null,"display_name":"J.A. Medina","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.A. Medina","raw_affiliation_strings":["Computer Science Department, University of Massachusetts, Amherst, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053065200","display_name":"Neil Immerman","orcid":"https://orcid.org/0000-0001-6609-5952","observed_orcids":["https://orcid.org/0000-0001-6609-5952"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Immerman","raw_affiliation_strings":["Computer Science Department, University of Massachusetts, Amherst, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.473,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.51510774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"250"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.48899999260902405,"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.48899999260902405,"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.44429999589920044,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.031099999323487282,"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/np-completeness","display_name":"NP-completeness","score":0.9909999966621399},{"id":"https://openalex.org/keywords/syntactic-characterization","display_name":"syntactic characterization","score":0.9610000252723694},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.40799999237060547},{"id":"https://openalex.org/keywords/syntactic-reduction","display_name":"syntactic reduction","score":0.40400001406669617}],"concepts":[{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5728436708450317},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5521767735481262},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.5386500358581543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48596322536468506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48005566000938416},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4758555591106415},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.47563743591308594},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.46306246519088745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44308921694755554},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.440960556268692},{"id":"https://openalex.org/C127882523","wikidata":"https://www.wikidata.org/wiki/Q38066","display_name":"Existentialism","level":2,"score":0.43295639753341675},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4262385666370392},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2495485246181488},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1729196310043335},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.13017773628234863},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.06527814269065857},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.1994.316065","doi":"https://doi.org/10.1109/lics.1994.316065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.1994.316065","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","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":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","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":14,"referenced_works":["https://openalex.org/W1495098865","https://openalex.org/W1499126844","https://openalex.org/W1651830791","https://openalex.org/W1812706522","https://openalex.org/W1970629906","https://openalex.org/W2036265926","https://openalex.org/W2038225707","https://openalex.org/W2065939997","https://openalex.org/W2116940701","https://openalex.org/W2171840823","https://openalex.org/W3127113455","https://openalex.org/W4213009134","https://openalex.org/W4245713184","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W1545280167","https://openalex.org/W2561422107","https://openalex.org/W2154622013","https://openalex.org/W2153781396","https://openalex.org/W2088467794","https://openalex.org/W2043438634","https://openalex.org/W2128514044","https://openalex.org/W2963635167","https://openalex.org/W7096314227","https://openalex.org/W2013549520"],"abstract_inverted_index":{"Fagin":[0],"(1974)":[1],"proved":[2],"that":[3,22,41,46,98,109],"NP":[4],"is":[5,99],"equal":[6],"to":[7,34,76,94],"the":[8,39],"set":[9],"of":[10,44],"problems":[11,21,45,71,113],"expressible":[12],"in":[13],"second-order":[14],"existential":[15],"logic":[16],"(SO/spl":[17],"exist/).":[18],"We":[19,81],"consider":[20],"are":[23,32,47,51],"NP-complete":[24,48,78,100,112],"via":[25,49,53,79,101,116],"first-order":[26,55],"projections":[27],"(fops).":[28],"These":[29],"low-level":[30],"reductions":[31],"known":[33],"have":[35],"nice":[36],"properties,":[37],"including":[38],"fact":[40],"every":[42],"pair":[43],"fops":[50],"isomorphic":[52],"a":[54,83,96],"definable":[56],"isomorphism":[57],"(E.":[58],"Allender":[59],"et":[60],"al.,":[61],"1993).":[62],"However,":[63],"before":[64],"this":[65,104],"paper,":[66],"fewer":[67],"than":[68],"five":[69],"natural":[70,111],"had":[72],"actually":[73],"been":[74],"shown":[75],"be":[77],"fops.":[80,102],"give":[82],"necessary":[84],"and":[85],"sufficient":[86],"syntactic":[87],"condition":[88,105],"for":[89],"an":[90],"SO/spl":[91],"exist/":[92],"formula":[93],"represent":[95],"problem":[97],"Using":[103],"we":[106],"prove":[107],"syntactically":[108],"29":[110],"remain":[114],"complete":[115],"fops.>":[117]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2152196641","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
