On Generic Np-Completeness of the Boolean Satisfiability Problem

Prikladnaya Diskretnaya Matematika - Russian Federation
doi 10.17223/20710410/36/8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

Boolean Satisfiability With Transitivity Constraints

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2002English

Boolean Satisfiability in Quantum Compilation

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2019English

Query Order and NP-completeness

English

Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1991English

Shatter: Efficient Symmetry-Breaking for Boolean Satisfiability

English

Trusses, NP-Completeness, and Genetic Algorithms

2006English

Vandermonde Matrices, NP-Completeness, and Transversal Subspaces

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2003English

Bi-Immunity Separates Strong NP-Completeness Notions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

NP-Completeness of Minimal Width Unordered Tree Layout

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy