A threshold for a polynomial solution of \#2SAT
type: Item
instance of: scholarly article
zbMATH Open document ID: 1253.68169
author: Guillermo De Ita
author: J. Raymundo Marcial-Romero
author: José Hernández
publication date: 2012-06-19T00:00:00Z
full work available at URL: fulltext.html
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6047763
zbMATH Keywords: \#2SAT problem
zbMATH Keywords: branch-bound algorithm
zbMATH Keywords: polynomial thresholds
zbMATH Keywords: efficient counting
MaRDI profile type: Publication
Recommended article: Polynomial threshold reoptimization of generalized satisfiability problems with bounded arity predicates
Recommended article: Polynomially solvable satisfiability problems
Recommended article: On Quadratic Threshold CSPs
Recommended article: Q5403036
Recommended article: Upper bounds on the satisfiability threshold
Recommended article: The asymptotic k-SAT threshold
Recommended article: The asymptotic \(k\)-SAT threshold
Recommended article: Q5009542
Recommended article: The Satisfiability Threshold fork-XORSAT
Recommended article: On Threshold Circuits and Polynomial Computation
title: A threshold for a polynomial solution of \#2SAT
published in: Fundamenta Informaticae
description: scientific article; zbMATH DE number 6047763