Analysis of L-Structure of Polyhedron in the Partial Max Sat Problem

Prikladnaya Diskretnaya Matematika - Russian Federation
doi 10.17223/20710410/38/9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

Complexity of Max-Sat Using Stochastic Algorithms

2008English

The Power of Semidefinite Programming Relaxations for MAX-SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Randomized Variants of Johnson's Algorithm for MAX SAT

2011English

Parametric RBAC Maintenance via Max-Sat

2018English

MiniMaxSAT: An Efficient Weighted Max-Sat Solver

Journal of Artificial Intelligence Research
Artificial Intelligence
2008English

Approximate Solution of Weighted MAX-SAT Problems Using GRASP

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

Solving the SAT Problem Using Genetic Algorithm

Advances in Science, Technology and Engineering Systems
EngineeringAstronomyPhysicsManagement of TechnologyInnovation
2017English

A Max-Sat Solver With Lazy Data Structures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Compiling Problem Specifications Into SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy