{"id":"https://openalex.org/W2100919882","doi":"https://doi.org/10.1109/ismvl.2004.1319950","title":"The interface between P and NP in signed CNF formulas","display_name":"The interface between P and NP in signed CNF formulas","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W2100919882","doi":"https://doi.org/10.1109/ismvl.2004.1319950","mag":"2100919882"},"language":"en","primary_location":{"id":"doi:10.1109/ismvl.2004.1319950","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl.2004.1319950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 34th International Symposium on Multiple-Valued Logic","raw_type":"proceedings-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/A5039752849","display_name":"Carlos Ans\u00f3tegui","orcid":"https://orcid.org/0000-0001-7727-2766"},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"C. Ansotegui","raw_affiliation_strings":["Department of Computer Science, Universitat de Lleida, Lleida, Spain","Dept. of Comput. Sci., Univ. de Lleida, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universitat de Lleida, Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. de Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047023182","display_name":"Ram\u00f3n B\u00e9jar","orcid":"https://orcid.org/0000-0002-5208-685X"},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"R. Bejar","raw_affiliation_strings":["Department of Computer Science, Universitat de Lleida, Lleida, Spain","Dept. of Comput. Sci., Univ. de Lleida, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universitat de Lleida, Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. de Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065186307","display_name":"Alba Cabiscol","orcid":"https://orcid.org/0000-0002-6167-7512"},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"A. Cabiscol","raw_affiliation_strings":["Department of Computer Science, Universitat de Lleida, Lleida, Spain","Dept. of Comput. Sci., Univ. de Lleida, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universitat de Lleida, Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. de Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061148416","display_name":"Felip Many\u00e0","orcid":"https://orcid.org/0000-0002-8366-1458"},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"F. Manya","raw_affiliation_strings":["Department of Computer Science, Universitat de Lleida, Lleida, Spain","Dept. of Comput. Sci., Univ. de Lleida, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universitat de Lleida, Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. de Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039752849"],"corresponding_institution_ids":["https://openalex.org/I15766328"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17936713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"251","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9905999898910522,"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.9850999712944031,"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/satisfiability","display_name":"Satisfiability","score":0.7931019067764282},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.5798133611679077},{"id":"https://openalex.org/keywords/interface","display_name":"Interface (matter)","score":0.5534053444862366},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5430880784988403},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5315551161766052},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4864375591278076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47678282856941223},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4693729877471924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4377310276031494},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42539122700691223},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40645813941955566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2500791549682617},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.08512315154075623}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7931019067764282},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5798133611679077},{"id":"https://openalex.org/C113843644","wikidata":"https://www.wikidata.org/wiki/Q901882","display_name":"Interface (matter)","level":4,"score":0.5534053444862366},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5430880784988403},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5315551161766052},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4864375591278076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47678282856941223},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4693729877471924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4377310276031494},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42539122700691223},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40645813941955566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2500791549682617},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.08512315154075623},{"id":"https://openalex.org/C129307140","wikidata":"https://www.wikidata.org/wiki/Q6795880","display_name":"Maximum bubble pressure method","level":3,"score":0.0},{"id":"https://openalex.org/C157915830","wikidata":"https://www.wikidata.org/wiki/Q2928001","display_name":"Bubble","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ismvl.2004.1319950","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl.2004.1319950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 34th International Symposium on Multiple-Valued Logic","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W4983232","https://openalex.org/W14839205","https://openalex.org/W27828651","https://openalex.org/W29806926","https://openalex.org/W39510960","https://openalex.org/W71312745","https://openalex.org/W125178576","https://openalex.org/W1502527706","https://openalex.org/W1521053613","https://openalex.org/W1571393741","https://openalex.org/W1591324994","https://openalex.org/W1600919542","https://openalex.org/W1620410031","https://openalex.org/W1650993530","https://openalex.org/W1873470583","https://openalex.org/W1885994280","https://openalex.org/W2004472922","https://openalex.org/W2035493071","https://openalex.org/W2057361103","https://openalex.org/W2137137684","https://openalex.org/W2152245044","https://openalex.org/W2472706177","https://openalex.org/W2533858263","https://openalex.org/W4250620173","https://openalex.org/W6600203084","https://openalex.org/W6600610889","https://openalex.org/W6605109351","https://openalex.org/W6630207426","https://openalex.org/W6636690859","https://openalex.org/W6682342474"],"related_works":["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/W2963044240","https://openalex.org/W2076399409","https://openalex.org/W2003979824"],"abstract_inverted_index":{"We":[0,18,37],"first":[1],"define":[2],"a":[3,51],"new":[4],"class":[5],"of":[6,64],"signed":[7],"CNF":[8],"formulas":[9],"and":[10,27,35,46,53,57],"prove":[11],"that":[12,39],"its":[13],"satisfiability":[14,32],"problem":[15],"is":[16],"NP-complete.":[17],"then":[19],"study":[20],"in":[21,29,62],"detail":[22],"the":[23],"interface":[24],"between":[25,44],"P":[26,45],"NP":[28,47],"two":[30],"many-valued":[31],"problems:":[33],"Mono+pPartiallySigned-2SAT":[34],"Regular+pSigned-2SAT.":[36],"show":[38],"such":[40],"problems":[41],"smoothly":[42],"interpolate":[43],"by":[48],"mixing":[49],"together":[50],"polynomial":[52],"an":[54],"NP-complete":[55],"problem,":[56],"identify":[58],"phase":[59],"transition":[60],"behavior":[61],"each":[63],"these":[65],"problems.":[66]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}