scientific article; zbMATH DE number 1114011

zbMath0889.68075MaRDI QIDQ4375779

Hans van Maaren

Publication date: 2 June 1998

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

zbMATH Keywords

CNF formulae

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Boolean programming (90C09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Elliptic approximations of propositional formulae ⋮ Recognition of tractable satisfiability problems through balanced polynomial representations ⋮ Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT ⋮ Solving satisfiability problems using elliptic approximations -- effective branching rules

This page was built for publication: