Paper by Erik D. Demaine

Reference:

Max Bannach, Erik D. Demaine, Timothy Gomez, and Markus Hecher, “A Novel Reduction from #SAT to #2SAT Based on Symmetry: Simply Drop the Large Clauses”, in Proceedings of the 2026 SIAM Symposium on Simplicity in Algorithms (SOSA 2026), 2026, pages 254–265.

BibTeX

@InProceedings{SharpSAT_SOSA2026,
  AUTHOR        = {Max Bannach and Erik D. Demaine and Timothy Gomez and Markus Hecher},
  TITLE         = {A Novel Reduction from {\#SAT} to {\#2SAT} Based on Symmetry: Simply Drop the Large Clauses},
  BOOKTITLE     = {Proceedings of the 2026 SIAM Symposium on Simplicity in Algorithms (SOSA 2026)},
  bookurl       = {https://www.siam.org/conferences-events/past-event-archive/sosa26/},
  YEAR          = 2026,
  PAGES         = {254--265},

  papers        = {SharpSAT_ISAAC2024},
  withstudent   = 1,
  doi           = {https://dx.doi.org/10.1137/1.9781611978964.19},
  dblp          = {https://dblp.org/rec/conf/sosa/BannachDGH26},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1137/1.9781611978964.19">SIAM</A>.},
}

Comments:

This paper is also available from SIAM.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

SharpSAT_ISAAC2024 (Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs)