The complexity of facets resolved
From MaRDI portal
Publication:1109565
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- NP is as easy as detecting unique solutions
- On certain polytopes associated with graphs
- On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- On the unique satisfiability problem
- Solution of a Large-Scale Traveling-Salesman Problem
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The complexity of facets (and some facets of complexity)
Cited in
(61)- Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics
- Finding optimal solutions with neighborly help
- On the complexity of semantic self-minimization
- Witnesses for Answer Sets of Logic Programs
- Super-reparametrizations of weighted CSPs: properties and optimization perspective
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- Using inconsistency measures for estimating reliability
- Selected topics on assignment problems
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- On the computational complexity of read once resolution decidability in 2CNF formulas
- On the complexity of inconsistency measurement
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Extension and equivalence problems for clause minimal formulae
- Better approximations of non-Hamiltonian graphs
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Complexity of Stability.
- An upper bound for the circuit complexity of existentially quantified Boolean formulas
- Dealing Automatically with Exceptions by Introducing Specificity in ASP
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
- DP-Complete Problems Derived from Extremal NP-Complete Properties
- An approach for extracting a small unsatisfiable core
- Homomorphisms of conjunctive normal forms.
- On the structure of some classes of minimal unsatisfiable formulas
- How to recycle your facets
- Strong inconsistency
- The complexity of recognizing minimally tough graphs
- Redundancy in logic. I: CNF propositional formulae
- The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
- Density condensation of Boolean formulas
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- How Many Conflicts Does It Need to Be Unsatisfiable?
- On the query complexity of selecting minimal sets for monotone predicates
- Local-search extraction of mUSes
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- Redundancy in logic. III: Non-monotonic reasoning
- Two tractable subclasses of minimal unsatisfiable formulas
- Localising iceberg inconsistencies
- Semantic relevance
- A framework for handling logical inconsistencies in the fusion of Boolean knowledge bases
- Finding read-once resolution refutations in systems of 2CNF clauses
- Removing redundancy from a clause
- Complexity of stability
- On subclasses of minimal unsatisfiable formulas
- Finding Optimal Solutions With Neighborly Help.
- On semidefinite least squares and minimal unsatisfiability
- Computing maximal autarkies with few and simple oracle queries
- Recognizing frozen variables in constraint satisfaction problems
- The complexity of variable minimal formulas
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- Fixed-parameter tractability of satisfying beyond the number of variables
- On the complexity of non-unique probe selection
- Using local search to find MSSes and MUSes
- Complexity Classifications for Logic-Based Argumentation
- On measuring inconsistency in definite and indefinite databases with denial constraints
- Computing smallest MUSes of quantified Boolean formulas
- A simplified way of proving trade-off results for resolution
- Knapsack polytopes: a survey
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency
This page was built for publication: The complexity of facets resolved
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109565)
