{"id":"https://openalex.org/W2045690379","doi":"https://doi.org/10.1145/2499937.2499941","title":"Parameterized Complexity of DPLL Search Procedures","display_name":"Parameterized Complexity of DPLL Search Procedures","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2045690379","doi":"https://doi.org/10.1145/2499937.2499941","mag":"2045690379"},"language":"en","primary_location":{"id":"doi:10.1145/2499937.2499941","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2499937.2499941","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5042128349","display_name":"Olaf Beyersdorff","orcid":"https://orcid.org/0000-0002-2870-1648"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["GB","IT"],"is_corresponding":false,"raw_author_name":"Olaf Beyersdorff","raw_affiliation_strings":["University of Leeds and Sapienza University of Rome"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Leeds and Sapienza University of Rome","institution_ids":["https://openalex.org/I130828816","https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084573067","display_name":"Nicola Galesi","orcid":"https://orcid.org/0000-0002-8522-362X"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Galesi","raw_affiliation_strings":["Sapienza University of Rome"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024267515","display_name":"Massimo Lauria","orcid":"https://orcid.org/0000-0003-4003-3168"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Massimo Lauria","raw_affiliation_strings":["KTH Royal Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.9215,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.9371203,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"14","issue":"3","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9961000084877014,"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.9961000084877014,"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.9959999918937683,"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/T10142","display_name":"Formal Methods in Verification","score":0.9958000183105469,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.9458717703819275},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9296361207962036},{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.9126945734024048},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6727334856987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5890971422195435},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5795254111289978},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45729199051856995},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42099079489707947},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.4136427640914917},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.41021695733070374},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3656964600086212},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3509690761566162},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33768966794013977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32588791847229004},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26604825258255005},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07800400257110596}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9458717703819275},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9296361207962036},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.9126945734024048},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6727334856987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5890971422195435},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5795254111289978},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45729199051856995},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42099079489707947},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.4136427640914917},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41021695733070374},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3656964600086212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3509690761566162},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33768966794013977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32588791847229004},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26604825258255005},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07800400257110596},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2499937.2499941","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2499937.2499941","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:74773","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.704.462","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.704.462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.kth.se/%7Elauria/documents/para-dpll.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/496979","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/496979","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306193","display_name":"John Templeton Foundation","ror":"https://ror.org/035tnyy05"},{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W1902951782","https://openalex.org/W1979753555","https://openalex.org/W1986272823","https://openalex.org/W1988083342","https://openalex.org/W1988762827","https://openalex.org/W1989274820","https://openalex.org/W1990604066","https://openalex.org/W1995885398","https://openalex.org/W1996660205","https://openalex.org/W1998430462","https://openalex.org/W2044722214","https://openalex.org/W2047237020","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2067510740","https://openalex.org/W2069767473","https://openalex.org/W2071347463","https://openalex.org/W2079758416","https://openalex.org/W2084029169","https://openalex.org/W2084384424","https://openalex.org/W2092508401","https://openalex.org/W2092984557","https://openalex.org/W2097113315","https://openalex.org/W2098022011","https://openalex.org/W2100738443","https://openalex.org/W2105786826","https://openalex.org/W2110128015","https://openalex.org/W2112145019","https://openalex.org/W2126362918","https://openalex.org/W2126420408","https://openalex.org/W2137423523","https://openalex.org/W2142127354","https://openalex.org/W2150419136","https://openalex.org/W2150936971","https://openalex.org/W2152390092","https://openalex.org/W2157569050","https://openalex.org/W2159233562","https://openalex.org/W2171790376","https://openalex.org/W2323554188","https://openalex.org/W2396992663","https://openalex.org/W2478722229","https://openalex.org/W2611365002","https://openalex.org/W2913222977","https://openalex.org/W2913688336","https://openalex.org/W3103546459","https://openalex.org/W3144881883","https://openalex.org/W4251265810","https://openalex.org/W4292230561","https://openalex.org/W6630973240"],"related_works":["https://openalex.org/W2045690379","https://openalex.org/W2007316622","https://openalex.org/W2408711288","https://openalex.org/W1024451821","https://openalex.org/W4313407580","https://openalex.org/W2094368841","https://openalex.org/W2048447692","https://openalex.org/W2128006027","https://openalex.org/W2089119454","https://openalex.org/W2120006490"],"abstract_inverted_index":{"We":[0,64,103],"study":[1,87],"the":[2,40,57,73,79,88,92,107,125,129,149],"performance":[3],"of":[4,43,60,94,109,121,132,147,152,155],"DPLL":[5,44,62,89],"algorithms":[6],"on":[7],"parameterized":[8,61,74],"problems.":[9,29],"In":[10],"particular,":[11],"we":[12,33,47,86],"investigate":[13],"how":[14],"difficult":[15],"it":[16],"is":[17],"to":[18,52,56,72,78,124],"decide":[19],"whether":[20,96],"small":[21,101],"solutions":[22],"exist":[23],"for":[24,91,117],"satisfiability":[25],"and":[26,46,77],"other":[27],"combinatorial":[28],"For":[30,128],"this":[31,66,136,153],"purpose":[32],"develop":[34],"a":[35,97,100,110,118,139],"Prover-Delayer":[36],"game":[37],"that":[38,105],"models":[39],"running":[41,58],"time":[42,59],"procedures":[45],"establish":[48],"an":[49],"information-theoretic":[50],"method":[51],"obtain":[53],"lower":[54,70],"bounds":[55,71],"procedures.":[63],"illustrate":[65],"technique":[67],"by":[68,142],"showing":[69],"pigeonhole":[75],"principle":[76],"ordering":[80],"principle.":[81],"As":[82],"our":[83],"main":[84],"application":[85],"procedure":[90],"problem":[93],"deciding":[95],"graph":[98],"has":[99],"clique.":[102],"show":[104],"proving":[106],"absence":[108],"k":[111],"-clique":[112],"requires":[113],"n":[114],"\u03a9(k)":[115],"steps":[116],"nontrivial":[119],"distribution":[120],"graphs":[122],"close":[123],"critical":[126],"threshold.":[127],"restricted":[130],"case":[131],"tree-like":[133],"Parameterized":[134],"Resolution,":[135],"result":[137],"answers":[138],"question":[140],"asked":[141],"Beyersdorff":[143],"et":[144],"al.":[145],"[2012]":[146],"understanding":[148],"Resolution":[150],"complexity":[151],"family":[154],"formulas.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}