
LaserTank is NPcomplete
We show that the classical game LaserTank is NPcomplete, even when the ...
read it

Tetris is NPhard even with O(1) rows or columns
We prove that the classic fallingblock video game Tetris (both survival...
read it

Maximum cut on interval graphs of interval count four is NPcomplete
The computational complexity of the MaxCut problem restricted to interva...
read it

An Algorithm for the Discovery of Independence from Data
For years, independence has been considered as an important concept in m...
read it

NPcomplete variants of some classical graph problems
Some classical graph problems such as finding minimal spanning tree, sho...
read it

Proving the NPcompleteness of optimal moral graph triangulation
Moral graphs were introduced in the 1980s as an intermediate step when t...
read it

A Probabilistic Attack on NPcomplete Problems
Using the probability theorybased approach, this paper reveals the equi...
read it
Revising Johnson's table for the 21st century
What does it mean today to study a problem from a computational point of view? We focus on parameterized complexity and on Column 16 "Graph Restrictions and Their Effect" of D. S. Johnson's Ongoing guide, where several puzzles were proposed in a summary table with 30 graph classes as rows and 11 problems as columns. Several of the 330 entries remain unclassified into Polynomial or NPcomplete after 35 years. We provide a full dichotomy for the Steiner Tree column by proving that the problem is NPcomplete when restricted to Undirected Path graphs. We revise Johnson's summary table according to the granularity provided by the parameterized complexity for NPcomplete problems.
READ FULL TEXT
Comments
There are no comments yet.