scientific article

zbMath1253.68169MaRDI QIDQ2892663

J. Raymundo Marcial-Romero, José A. Hernández, Guillermo de Ita

Publication date: 19 June 2012

Full work available at URL: http://iospress.metapress.com/content/136706724808641n/fulltext.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

efficient counting\#2SAT problembranch-bound algorithmpolynomial thresholds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Using binary patterns for counting falsifying assignments of conjunctive forms

This page was built for publication: