scientific article; zbMATH DE number 6469161

Publication date: 3 August 2015

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

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items

An improved exact algorithm for the domatic number problem, Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG, Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas, Derandomizing the HSSW algorithm for 3-SAT, The Time Complexity of Constraint Satisfaction, A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances, Towards NP-P via proof complexity and search, A randomized algorithm for 3-SAT, A combinatorial analysis for the critical clause tree, An exact algorithm for the Boolean connectivity problem for \(k\)-CNF, Modelling the dynamics of stochastic local search on \(k\)-SAT, Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT, The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs, Computing branchwidth via efficient triangulations and blocks, An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes, k-SAT Is No Harder Than Decision-Unique-k-SAT, Walksat Stalls Well Below Satisfiability