Selection of a large sum-free subset in polynomial time (Q1318751)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Selection of a large sum-free subset in polynomial time |
scientific article; zbMATH DE number 540893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Selection of a large sum-free subset in polynomial time |
scientific article; zbMATH DE number 540893 |
Statements
Selection of a large sum-free subset in polynomial time (English)
0 references
5 April 1994
0 references
polynomial time
0 references
sum-free subset
0 references
deterministic algorithm
0 references
0.7965052127838135
0 references
0.7957440614700317
0 references
0.7900954484939575
0 references
