{"id":"https://openalex.org/W7224798200","doi":"https://doi.org/10.48550/arxiv.2610.39992","title":"Accumulating Pruning Constraints: New Exact Polynomial-Space Algorithms for Max 2-SAT","display_name":"Accumulating Pruning Constraints: New Exact Polynomial-Space Algorithms for Max 2-SAT","publication_year":2026,"publication_date":"2026-10-29","ids":{"openalex":"https://openalex.org/W7224798200","doi":"https://doi.org/10.48550/arxiv.2610.39992"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.39992","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.39992","pdf_url":"https://arxiv.org/pdf/2610.39992","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.39992","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069687493","display_name":"Konstantin Kutzkov","orcid":"https://orcid.org/0000-0002-7334-6868","observed_orcids":["https://orcid.org/0000-0002-7334-6868"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kutzkov, Konstantin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5069687493"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4702000021934509,"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.4702000021934509,"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.41429999470710754,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10819999873638153,"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/max-2-sat","display_name":"MAX-2-SAT","score":0.9980000257492065},{"id":"https://openalex.org/keywords/polynomial-space-algorithms","display_name":"polynomial space algorithms","score":0.8289999961853027},{"id":"https://openalex.org/keywords/exact-algorithms","display_name":"exact algorithms","score":0.4830000102519989},{"id":"https://openalex.org/keywords/clause-density","display_name":"clause density","score":0.6700000166893005},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.8109999895095825},{"id":"https://openalex.org/keywords/expander-graphs","display_name":"expander graphs","score":0.9639999866485596},{"id":"https://openalex.org/keywords/stochastic-block-model","display_name":"stochastic block model","score":0.9929999709129333},{"id":"https://openalex.org/keywords/exponential-time-algorithms","display_name":"exponential-time algorithms","score":0.3630000054836273}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7210000157356262},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6758000254631042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.586899995803833},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5264000296592712},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4650999903678894},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43209999799728394},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.4268999993801117},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40880000591278076},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.39640000462532043},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.39259999990463257},{"id":"https://openalex.org/C2779982251","wikidata":"https://www.wikidata.org/wiki/Q25053762","display_name":"Stochastic block model","level":3,"score":0.3910999894142151},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.38359999656677246},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3517000079154968},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.32820001244544983},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.296999990940094},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.29019999504089355},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.25060001015663147},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.39992","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.39992","pdf_url":"https://arxiv.org/pdf/2610.39992","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2610.39992","doi":"https://doi.org/10.48550/arxiv.2610.39992","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.39992","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.39992","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.39992","pdf_url":"https://arxiv.org/pdf/2610.39992","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7224798200.pdf","grobid_xml":"https://content.openalex.org/works/W7224798200.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2041669358","https://openalex.org/W6886146553","https://openalex.org/W7095852715","https://openalex.org/W17690413","https://openalex.org/W2739024676","https://openalex.org/W2950518831","https://openalex.org/W2158953726","https://openalex.org/W2029489766","https://openalex.org/W2191626561","https://openalex.org/W1993837454"],"abstract_inverted_index":{"We":[0],"present":[1],"deterministic":[2],"polynomial-space":[3,166],"algorithms":[4,141,167],"that":[5,62,119],"solve":[6],"Max":[7,178,195],"2-SAT":[8,179],"on":[9,20,98,103,129,145],"$n$":[10],"variables":[11,118],"exactly":[12],"in":[13,209],"time":[14,150,172],"$\\Ostar(2^{(1-\u03b3)n})$,":[15],"for":[16,173,194,206,211],"a":[17,45,59,107,112,122,170,219],"fixed":[18],"$\u03b3>0$,":[19],"several":[21],"classes":[22,86,175],"of":[23,55,82,117,176,203],"instances":[24],"whose":[25],"clause":[26,123],"density":[27],"may":[28,120],"grow":[29],"with":[30,89,153,168],"$n$.":[31],"Our":[32],"main":[33],"tool":[34],"extends":[35],"the":[36,42,52,56,83,115,127,140,149,157,164,184],"classic":[37],"DPLL":[38],"branching":[39,192],"algorithm.":[40],"When":[41],"search":[43],"gives":[44],"variable":[46,57],"its":[47],"less":[48],"promising":[49],"value,":[50],"comparing":[51],"two":[53],"values":[54],"yields":[58],"pruning":[60,185],"constraint":[61,216],"is":[63],"satisfied":[64],"by":[65,106],"some":[66],"optimal":[67],"assignment.":[68],"Accumulating":[69],"these":[70,130,162,182],"constraints":[71,186],"along":[72],"each":[73,215],"branch":[74],"prunes":[75],"all":[76],"but":[77],"an":[78],"exponentially":[79],"small":[80],"fraction":[81],"assignments.":[84],"The":[85],"are":[87,124,132,142,163],"formulas":[88,136],"many":[90],"biased":[91],"variables,":[92],"semirandom":[93,113,135],"2-CNF":[94],"formulas,":[95,208],"and":[96,102,126,137,148,197],"Max-Cut":[97],"regular":[99],"expander":[100],"graphs":[101,104],"generated":[105],"stochastic":[108],"block":[109],"model.":[110],"In":[111],"formula,":[114],"pairs":[116,131],"share":[121],"arbitrary,":[125],"clauses":[128],"random.":[133],"For":[134],"block-model":[138],"graphs,":[139],"still":[143],"exact":[144],"every":[146],"input,":[147],"bound":[151],"holds":[152],"high":[154],"probability":[155],"over":[156],"input.":[158],"To":[159],"our":[160],"knowledge,":[161],"first":[165],"such":[169],"running":[171],"nontrivial":[174],"dense":[177],"instances.":[180],"Beyond":[181],"classes,":[183],"can":[187],"be":[188,202],"added":[189],"to":[190,201],"any":[191],"algorithm":[193],"2-SAT,":[196],"we":[198],"expect":[199],"them":[200],"practical":[204],"relevance":[205],"general":[207],"particular":[210],"sparse":[212],"ones,":[213],"where":[214],"involves":[217],"only":[218],"few":[220],"variables.":[221]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2026-10-31T00:00:00"}