scientific article; zbMATH DE number 2080304
From MaRDI portal
Publication:4473023
zbMath1044.68746MaRDI QIDQ4473023
Demetrios D. Demopoulos, Devika Subramanian, Moshe Y. Vardi, Cristian Coarfa, Alfonso San Miguel Aguirre
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1894/18940143.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
A sharp threshold in proof complexity yields lower bounds for satisfiability search ⋮ Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances ⋮ On SAT instance classes and a method for reliable performance experiments with SAT solvers ⋮ Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT ⋮ New models for generating hard random Boolean formulas and disjunctive logic programs ⋮ On the typical case complexity of graph optimization
Uses Software
This page was built for publication:
