Sage Journals: Discover world-class research

Retricted access

Research article

First published 1980

NP -completeness of combinatorial problems with unary notation for integers

Martti Penttonen

Fundamenta Informaticae

Retricted access

Research article

First published 1981

Lattice Theoretic Ordering Properties for NP-Complete Optimization Problems

Giorgio Ausiello, Alessandro d’Atri, Marco Protasi

Fundamenta Informaticae

Retricted access

Research article

First published 2013-8

The Reconstruction of Polyominoes from Horizontal and Vertical Projections and Morphological Skeleton is NP-complete

Norbert Hantos, Péter Balázs

Fundamenta Informaticae

Retricted access

Research article

First published 1983

Generalizations of the Consecutive Ones Property and Related NP-Complete Problems 1

Witold Lipski

Fundamenta Informaticae

Retricted access

Research article

First published 1984

Generalized Polynomial-Time Reducibilities,Degrees and NP-Completeness

Uwe Schöning

Fundamenta Informaticae

Retricted access

Research article

First published 2008-3-1

A SURVEY OF NP-COMPLETE PUZZLES

Graham Kendall, Andrew Parkes, Kristian Spoerer

ICGA Journal: The Journal of the Computer Games Community

Retricted access

Research article

First published 2011-01

The Cophylogeny Reconstruction Problem Is NP-Complete

Y. Ovadia, D. Fielder, C. Conow [...]

Journal of Computational Biology

Retricted access

Research article

First published 2010-10

Haplotype Inferring via Galled-Tree Networks Is NP-Complete

Arvind Gupta, Mohammad M. Karimi, Ján Maňuch [...]

Journal of Computational Biology

Retricted access

Research article

First published 2002-3

Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory

Claude Sureson

Fundamenta Informaticae

Retricted access

Research article

First published 1998-3

Protein Folding in the Hydrophobic-Hydrophilic ( HP ) Model is NP-Complete

Bonnie Berger, Tom Leighton

Journal of Computational Biology

Search results