{"id":"https://openalex.org/W2013115988","doi":"https://doi.org/10.1016/0304-3975(94)00182-i","title":"The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness","display_name":"The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness","publication_year":1995,"publication_date":"1995-07-01","ids":{"openalex":"https://openalex.org/W2013115988","doi":"https://doi.org/10.1016/0304-3975(94)00182-i","mag":"2013115988"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)00182-i","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00182-i","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5090333344","display_name":"Nadia Creignou","orcid":"https://orcid.org/0009-0005-6522-6363"},"institutions":[{"id":"https://openalex.org/I3019441195","display_name":"Laboratoire de Math\u00e9matiques d'Orsay","ror":"https://ror.org/03ab0zs98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I3019441195"]},{"id":"https://openalex.org/I98702875","display_name":"Universit\u00e9 de Caen Normandie","ror":"https://ror.org/051kpcy16","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nadia Creignou","raw_affiliation_strings":["D\u00e9partement de Math\u00e9matiques, Universit\u00e9 de Caen, 14032 Caen Cedex, France","Univ. de Caen, Caen, France#TAB#"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement de Math\u00e9matiques, Universit\u00e9 de Caen, 14032 Caen Cedex, France","institution_ids":["https://openalex.org/I3019441195"]},{"raw_affiliation_string":"Univ. de Caen, Caen, France#TAB#","institution_ids":["https://openalex.org/I98702875"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090333344"],"corresponding_institution_ids":["https://openalex.org/I3019441195","https://openalex.org/I98702875"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.0696,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.75191939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"145","issue":"1-2","first_page":"111","last_page":"145"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9994999766349792,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9922999739646912,"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/mathematics","display_name":"Mathematics","score":0.7876245975494385},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6176191568374634},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.604320228099823},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5479531288146973},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.49238264560699463},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.45452630519866943},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4276719093322754}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7876245975494385},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6176191568374634},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.604320228099823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5479531288146973},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.49238264560699463},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.45452630519866943},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4276719093322754}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(94)00182-i","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00182-i","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W204214429","https://openalex.org/W421997344","https://openalex.org/W1481767492","https://openalex.org/W1547393828","https://openalex.org/W1584670745","https://openalex.org/W2002089154","https://openalex.org/W2011039300","https://openalex.org/W2017996596","https://openalex.org/W2027678536","https://openalex.org/W2030147970","https://openalex.org/W2036265926","https://openalex.org/W2038225707","https://openalex.org/W2042654457","https://openalex.org/W2053309264","https://openalex.org/W2059813129","https://openalex.org/W2066356146","https://openalex.org/W2082154422","https://openalex.org/W2085938002","https://openalex.org/W2097371553","https://openalex.org/W2166566648","https://openalex.org/W2401610261","https://openalex.org/W2988590948","https://openalex.org/W3037175162","https://openalex.org/W4302339081","https://openalex.org/W6608371362","https://openalex.org/W6628942919","https://openalex.org/W6633000929","https://openalex.org/W6634823928","https://openalex.org/W6637387739","https://openalex.org/W6644040475","https://openalex.org/W6657527133","https://openalex.org/W6659573362","https://openalex.org/W6667052500","https://openalex.org/W6684468096"],"related_works":["https://openalex.org/W2083989568","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W2014111643","https://openalex.org/W2963044240"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}