Home
Examples
Products
Blog
About
Wolfram Research
Wolfram
Mathematica
Wolfram Demonstrations
Wolfram
MathWorld
Wolfram Science
Wolfram
Tones
More »
Wolfram|Alpha Computational Knowledge Engine
Enter what you want to calculate or know about:
Calculate
Examples
Random
Try your exact query in Wolfram|Alpha:
hitting set problem
major alternate name, proof, ...
Refresh now
Cached page
Input interpretation:
Statement:
History:
More
Classes:
Computed by
Wolfram
Mathematica
Source information »
Download as:
PDF
Live
Mathematica
Sign Up for Wolfram|Alpha News
Name
(optional)
Organization
(optional)
Email
Message
(optional)
Thank You
We appreciate your interest in Wolfram|Alpha and will be in touch soon.
—The Wolfram|Alpha Team
hitting set problem: major alternate name, proof, ...
Input: hitting set problem
hitting set problem
(mathematical problem)
Statement
Given a collection C of subsets of a finite set S and a positive integer K<=|S|, is there a subset S^,(subset equal)S with |S^,|<=K such that S^, contains at least one element from each subset in C?
History
status | proved NP-complete proof date | ( years ago) prover |
Richard Karp
Classes
NP complete problems | NP problems | mathematical problems | solved mathematics problems