Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Michael Tarsi
Graph Decomposition Is NP-Complete: A Complete Proof of Holyer's Conjecture
SIAM Journal on Computing
Mathematics
Computer Science
Related publications
Theory-Contraction Is NP-Complete
Logic Journal of the IGPL
Philosophy
Elastic Image Matching Is NP-complete
Pattern Recognition Letters
Signal Processing
Computer Vision
Pattern Recognition
Artificial Intelligence
Software
Call Tree Reversal Is NP-Complete
Lecture Notes in Computational Science and Engineering
Control
Combinatorics
Discrete Mathematics
Simulation
Engineering
Optimization
Modeling
Computational Mathematics
Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
Revising Distributed UNITY Programs Is NP-Complete
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Testing Orientability for Matroids Is NP-Complete
Advances in Applied Mathematics
Applied Mathematics
Checking Consistency of Pedigree Information Is NP-complete (Preliminary Report)
BRICS Report Series
An NP-complete Matching Problem
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
The Multivariate Quadratic Power Problem Over Zn Is Np-Complete
Information Technology and Control
Control
Systems Engineering
Computer Science Applications
Electrical
Electronic Engineering
