Selection of a large sum-free subset in polynomial time

DOI10.1016/0020-0190(94)90063-9MaRDI QIDQ1318751zbMATH OpenOpenAlexFDO

Authors 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

deterministic algorithmpolynomial timesum-free subset

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4149895
• Generalized sum-free subsets
• Estimates related to sumfree subsets of sets of integers
• Publication:4941832
• Sets of integers with no large sum-free subset

Cites work

• scientific article; zbMATH DE number 881158 (Why is no real title available?)
• scientific article; zbMATH DE number 3232871 (Why is no real title available?)
• scientific article; zbMATH DE number 4183487 (Why is no real title available?)
• Combinatorics. Room squares, sum-free sets, Hadamard matrices

Cited in

(3)

• A short note on Merlin-Arthur protocols for subset sum
• Proof of a conjecture of Kleinberg-Sawin-Speyer
• On the complexity of finding and counting solution-free sets of integers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318751)