The complexity of determinacy problem on group testing (Q913514): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some Completeness Results on Decision Trees and Group Testing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypergeometric and Generalized Hypergeometric Group Testing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
Revision as of 14:46, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of determinacy problem on group testing |
scientific article |
Statements
The complexity of determinacy problem on group testing (English)
0 references
1990
0 references
NP-completeness
0 references
polynomial-time algorithm
0 references
group testing
0 references
