Selection of a large sum-free subset in polynomial time
type: Item
instance of: scholarly article
title: Selection of a large sum-free subset in polynomial time
zbMATH Open document ID: 0789.11066
DOI: 10.1016/0020-0190(94)90063-9
author: Mihail N. Kolountzakis
published in: Information Processing Letters
publication date: 1994-04-05T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11B75
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 540893
zbMATH Keywords: polynomial time
zbMATH Keywords: sum-free subset
zbMATH Keywords: deterministic algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90063-9
OpenAlex ID: W2054528010
cites work: Q5749346
cites work: Q4878282
cites work: Q5520751
cites work: Combinatorics. Room squares, sum-free sets, Hadamard matrices
description: scientific article; zbMATH DE number 540893