scientific article; zbMATH DE number 1114011

MaRDI QIDQ4375779zbMATH OpenFDO

Authors Hans van Maaren

Publication date 2 June 1998

zbMATH Keywords

CNF formulae

Mathematics Subject Classification ID

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

Recommendations

• Deciding Satisfiability of Positive Second Order Joinability Formulae
• Second-order quantifier elimination. Foundations, computational aspects and applications
• scientific article; zbMATH DE number 637499
• Differential approximation for optimal satisfiability and related problems
• scientific article; zbMATH DE number 1163987
• How to prove decidability of equational theories with second-order computation analyser SOL
• Second-Order Sufficient Conditions in Nonsmooth Optimization
• Enumeration complexity of logical query problems with second-order variables
• Second-order linear-time computability with applications to computable analysis
• scientific article; zbMATH DE number 1336257

Cited in

(4)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375779)