An NP-complete matching problem

View on Open Library

An NP-complete matching problem

by David A. Plaisted

No reviews yet

First published: 1979 1 language

Subjects

Data processing Graph theory NP-complete problems Matching theory

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by David A. Plaisted

Efficiency of Theorem Proving Strategies

Efficiency of Theorem Proving Strategies

Theorem proving with abstraction, part I

Theorem proving with abstraction, part I

Theorem proving with abstraction, part II

Theorem proving with abstraction, part I...

Restricted oracles

Restricted oracles

An exponential lower bound for a restricted class of monotone formulae for 2-unsatisfiability

An exponential lower bound for a restric...

Complete problems in the first-order predicate calculus

Complete problems in the first-order pre...

You Might Also Like

More in Data processing

Bible

Bible

1990 census of population and housing

1990 census of population and housing

United States. Bureau of the Census

Tax administration

Tax administration

United States. General Accounting Office

Ender's Game

Orson Scott Card

Advances in Imaging and Electron Physics

Advances in Imaging and Electron Physics

Peter W. Hawkes

Management information systems

Management information systems

Kenneth C. Laudon