DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» SNP (complexity)
SNP (complexity)
Approximability Preserving Reduction Giorgio Ausiello, Vangelis Paschos
Constraint Satisfaction Problems and Descriptive Complexity
Satisfiability-Based Algorithms for Haplotype Inference
Parameterizing MAX SNP Problems Above Guaranteed Values
Algorithms for Optimization Problems in Planar Graphs
Satisfiability on Mixed Instances
ON the COMPLEXITY of the SINGLE INDIVIDUAL SNP HAPLOTYPING PROBLEM 2 at That Site
Decidable Relationships Between Consistency Notions for Constraint Satisfaction Problems
Approximate Constraint Satisfaction
Some Tight Results∗
On the Complexity of Constraint Satisfaction Problems a Model Theoretic Approach
Complexity, Combinatorial Positivity, and Newton Polytopes
1 Introduction
A 7=8-Approximation Algorithm for MAX 3SAT?
A Structural View of Approximation
Polynomial and APX-Hard Cases of the Individual Haplotyping Problem
A Why-On-Earth Tutorial on Finite Model Theory
Approximating Satisfiable Satisfiability Problems
Top View
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
Descriptive Complexity
Maximum Bounded 3-Dimensional Matching Is MAX SNP-Complete
Metafinite Model Theory* View Metadata, Citation and Similar Papers at Core.Ac.Uk Brought to You by CORE Erich GraDel Provided by Elsevier - Publisher Connector
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem
Differential Approximation of MIN SAT, MAX SAT and Related Problems Bruno Escoffier, Vangelis Paschos
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Planar Induced Subgraphs of Sparse Graphs
Complexity, Combinatorial Positivity, and Newton Polytopes
Expressivity Within Second-Order Transitive-Closure Logic
On Existential MSO and Its Relation to ETH
1 Unifying Themes in Finite Model Theory
Logic Minimization Techniques with Applications to Cryptology∗