scientific article
From MaRDI portal
Publication:2749862
zbMath0979.68128MaRDI QIDQ2749862
Thomas Stützle, Holger H. Hoos
Publication date: 3 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Nonnumerical algorithms (68W05)
Related Items
GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem, The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0, Unnamed Item, Learning dynamic algorithm portfolios, The ILTP problem library for intuitionistic logic, Learning MAX-SAT from contextual examples for combinatorial optimisation, The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0, Refining neural network predictions using background knowledge, A framework for certified Boolean branch-and-bound optimization, Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search, Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1, Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions, BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases, Generalized roof duality, On SAT instance classes and a method for reliable performance experiments with SAT solvers, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions, Efficiently checking propositional refutations in HOL theorem provers, Efficient Monte Carlo simulation via the generalized splitting method, On threshold BDDs and the optimal variable ordering problem, New developments in the theory of Gröbner bases and applications to formal verification, Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems, SATLIB, Backdoors in the Context of Learning, Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates, Polybori: A framework for Gröbner-basis computations with Boolean polynomials, Thousands of Geometric Problems for Geometric Theorem Provers (TGTP), Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, Implementing Efficient All Solutions SAT Solvers, A parallelization scheme based on work stealing for a class of SAT solvers
