The following pages link to (Q4375757):
Displaying 47 items.
- Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach (Q367248) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- A weight-balanced branching rule for SAT (Q597527) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Efficient Monte Carlo simulation via the generalized splitting method (Q746173) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- Logical and algorithmic properties of stable conditional independence (Q985147) (← links)
- Evaluating ASP and commercial solvers on the CSPLib (Q1020490) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- Experimental complexity analysis of continuous constraint satisfaction problems. (Q1425278) (← links)
- Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
- Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- A cost-reducing question-selection algorithm for propositional knowledge-based systems (Q1776198) (← links)
- On SAT instance classes and a method for reliable performance experiments with SAT solvers (Q1777389) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- 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 (Q1777400) (← links)
- Improving a fixed parameter tractability time bound for the shadow problem (Q1877708) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- Elliptic approximations of propositional formulae (Q1961455) (← links)
- Understanding the role of noise in stochastic local search: analysis and experiments (Q2389642) (← links)
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Satisfiability in composition-nominative logics (Q2445092) (← links)
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering (Q2457595) (← links)
- New tractable classes for default reasoning from conditional knowledge bases (Q2502153) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- Formal verification of a generic framework to synthesize SAT-provers (Q2583288) (← links)
- An Improved SAT Algorithm in Terms of Formula Length (Q3183448) (← links)
- Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
- Bounded Synthesis (Q3510817) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
- (Q5150565) (← links)
- ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH (Q5150716) (← links)
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM (Q5151087) (← links)
- The Service-Oriented Multiagent Approach to High-Performance Scientific Computing (Q5274957) (← links)
- Differentiable learning of matricized DNFs and its application to Boolean networks (Q6134346) (← links)
