Partial Searchlight Scheduling is Strongly PSPACE-complete Giovanni Viglietta∗ in 2-EXP. Whether SSP is NP-hard or even in NP is left in [2] as an open problem. More recently, in [4], the author introduced the

Source URL: giovanniviglietta.com

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch

Source URL: www.tik.ee.ethz.ch

• NP-complete problems
• Dominating set
• Approximation algorithm
• Domination
• Connected dominating set
• Domatic number

Creating Across puzzles using Across Lite Copyright Notice This is a copyrighted document owned by Literate Software Systems. Distribution of this document does not confer any rights to any entity other than to enable cr

Source URL: www.litsoft.com

• NP-complete problems
• Leisure
• Puzzles
• Computing
• Logic puzzles
• Crossword
• Rebus
• Newline
• Text file
• Microsoft Notepad
• PUZ

Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Graph operations
• NP-complete problems
• Graph coloring
• Cograph
• Clique
• Matching
• Pathwidth

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Analytical Approach to Parallel Repetition arXiv:1305.1979v2 [cs.CC] 15 May 2013 Irit Dinur∗

Source URL: arxiv.org

• NP-complete problems
• Mathematics
• Generalised Whitehead product
• Homotopy theory
• Unique games conjecture

d-collapsibility is NP-complete for d ≥ 4 Martin Tancer∗ November 28, 2009 Abstract A simplicial complex is d-collapsible if it can be reduced to an

Source URL: iti.mff.cuni.cz

A Fast Linear-Arithmetic Solver for DPLL(T) Bruno Dutertre and Leonardo de Moura Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, USA {bruno, demoura}@csl.sri.com

Source URL: yices.csl.sri.com

• Theoretical computer science
• Logic
• Mathematics
• Constraint programming
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Simplex algorithm
• Satisfiability

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Dominating set
• Independent set
• Vertex cover
• Connected dominating set
• Set cover problem
• Line graph
• Metric k-center
• Domatic number

Comparing Reductions to NP-Complete Sets John M. Hitchcock ∗ A. Pavan

Source URL: www.cs.uwyo.edu