scientific article; zbMATH DE number 2090009

zbMath1077.68657MaRDI QIDQ4808676

Vilhelm Dahllöf, Magnus Wahlström, Peter Jonsson

Publication date: 12 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2387/23870535.htm

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

New upper bound for the \#3-SAT problem ⋮ A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances ⋮ Picturing Counting Reductions with the ZH-Calculus ⋮ Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs ⋮ Faster exponential-time algorithms for approximately counting independent sets ⋮ Counting models for 2SAT and 3SAT formulae

This page was built for publication: