Selection of a large sum-free subset in polynomial time

DOI10.1016/0020-0190(94)90063-9zbMath0789.11066OpenAlexW2054528010MaRDI QIDQ1318751

Mihail N. Kolountzakis

Publication date: 5 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90063-9

zbMATH Keywords

polynomial timedeterministic algorithmsum-free subset

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Extremal set theory (05D05) Number-theoretic algorithms; complexity (11Y16) Other combinatorial number theory (11B75)

Related Items (1)

On the complexity of finding and counting solution-free sets of integers

Cites Work

• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Selection of a large sum-free subset in polynomial time