Results 241 to 250 of about 265,994 (263)

On the completeness of a generalized matching problem

Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78, 1978
A perfect matching in a graph H may be viewed as a collection of subgraphs of H, each of which is isomorphic to K2, whose vertex sets partition the vertex set of H. This is naturally generalized by replacing K2 by an arbitrary graph G. We show that if G contains a component with at least three vertices then this generalized matching problem is NP ...
David G. Kirkpatrick, Pavol Hell
openaire   +1 more source

A graph for NP-complete problems

Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35, 1997
A weighted directed graph GQ = (V, E) is defined for Q, the set of problems known to be NP-complete, with a vertex vi in V being an NP-complete problem pi in Q and the weight of an edge in E being the complexity of the transformation used to prove the NP-completeness of a problem. If the complexity of problem p1 relative to problem p2 is defined as the
openaire   +1 more source

The Problem of Completeness

1974
The peculiarity of the statistics generated by the algorithm of quantum mechanics can be brought out by recalling certain elementary features of the classical mathematical theory of probability. To introduce terminology, consider an experiment with a finite number of possible outcomes x1, x2…, xn of which one and only one can occur.
openaire   +1 more source

Minesweeper as an NP-complete problem

ACM SIGCSE Bulletin, 2005
Richard Kaye's demonstration that a puzzle based on the Minesweeper game is NP-complete makes this important computer science topic accessible to high school students. The resource described here is a set of slides showing the detailed solution of two introductory puzzles, following by the step-by-step simulation of digital circuit elements required ...
openaire   +1 more source

Advances on the Hamiltonian Completion Problem

Journal of the ACM, 1975
Seymour E. Goodman, Stephen T. Hedetniemi, Peter J. Slater   +2 more
openaire   +2 more sources

The transfer problem: a complete characterization

Theoretical Economics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

The subnormal completion problem in several variables

Journal of Mathematical Analysis and Applications, 2016
David P Kimsey
exaly  

A new heuristic for open shop total completion time problem

Applied Mathematical Modelling, 2010
Lixin Tang, Danyu Bai
exaly  

A new approach to the 2-variable Subnormal Completion Problem

Journal of Mathematical Analysis and Applications, 2010
Raúl E Curto, Jasang Yoon
exaly  

A Subnormal Completion Problem for Weighted Shifts on Directed Trees

Integral Equations and Operator Theory, 2018
Il Bong Jung, Exner George R, Jung Il Bong   +2 more
exaly