DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Parsimonious reduction
Parsimonious reduction
On Unique Graph 3-Colorability and Parsimonious Reductions in the Plane
Algebraic Polynomial Sum Solver Over {0 , 1}
COMPUTATIONAL COMPLEXITY Contents
Counting and Finding Homomorphisms Is Universal For
The Algorithmics Column by Thomas Erlebach Department of Informatics University of Leicester University Road, Leicester, LE1 7RH
Lecture Notes on Computational Complexity
The Complexity of Puzzles: NP-Completeness Results for Nurikabe and Minesweeper
Computational Complexity Spring 2001
Revisiting the Proof of the Complexity of the Sudoku Puzzle
The Complexity of Equivalence Relations
Catherine's Thesis
Complexity Issues in Counting, Polynomial Evaluation and Zero Finding Irénée Briquel
Enumeration Complexity of Logical Query Problems with Second Order Variables
Top View