Jump to content

Gadget (computer science)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dave6 (talk | contribs) at 21:57, 13 January 2007 (WP:AFC request by Hashproduct 21:01, 13 January 2007 (UTC)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computer science, gadgets are often used to construct reductions from one problem to another. Each element of the first problem is converted to a gadget built from elements of the second problem. For example, many reductions of 3-satisfiability to problems involving graphs use gadgets that represent variables and clauses of the 3-satisfiability instance; the gadgets themselves are "graph pieces" built from vertices and edges.

Edge Coloring is NP-Complete