Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by A. N. Rybalov
On Generic Np-Completeness of the Boolean Satisfiability Problem
Prikladnaya Diskretnaya Matematika
Signal Processing
Combinatorics
Applied Mathematics
Mathematics
Discrete Mathematics
Computational Theory
Theoretical Computer Science
Related publications
Boolean Satisfiability With Transitivity Constraints
ACM Transactions on Computational Logic
Computational Mathematics
Theoretical Computer Science
Computer Science
Logic
Boolean Satisfiability in Quantum Compilation
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
Mathematics
Engineering
Astronomy
Physics
Query Order and NP-completeness
Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem
Journal of the Operations Research Society of Japan
Management Science
Decision Sciences
Operations Research
Shatter: Efficient Symmetry-Breaking for Boolean Satisfiability
Trusses, NP-Completeness, and Genetic Algorithms
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
Foundations of Computational Mathematics
Mathematics
Computational Mathematics
Applied Mathematics
Analysis
Computational Theory
Bi-Immunity Separates Strong NP-Completeness Notions
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
NP-Completeness of Minimal Width Unordered Tree Layout
Journal of Graph Algorithms and Applications
Geometry
Computer Science Applications
Computer Science
Mathematics
Computational Theory
Theoretical Computer Science
Topology
