The complexity of determinacy problem on group testing (Q913514): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90095-t / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978227002 / rank | |||
Normal rank | |||
Latest revision as of 10:42, 30 July 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
