scientific article; zbMATH DE number 1256750
From MaRDI portal
Publication:4228486
zbMath0922.68058MaRDI QIDQ4228486
Sanjeev Khanna, Rajeev Motwani
Publication date: 1 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the efficiency of polynomial time approximation schemes, On planar valued CSPs, Intractability of assembly sequencing: Unit disks in the plane, PTAS for Sparse General-valued CSPs, Complexity and Algorithms for Well-Structured k-SAT Instances, Unnamed Item, Satisfiability, branch-width and Tseitin tautologies, Sublinear-space approximation algorithms for Max \(r\)-SAT, Max NP-completeness made easy, Succinct certification of monotone circuits, Partition into cliques for cubic graphs: Planar case, complexity and approximation, Network pollution games, The approximability of non-Boolean satisfiability problems and restricted integer programming, Succinct monotone circuit certification: planarity and parameterized complexity, Parameterized Complexity, Conjunctive query containment revisited, Planar 3-SAT with a clause/variable cycle, Parameterized computation and complexity: a new approach dealing with NP-hardness, Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
