Selection of a large sum-free subset in polynomial time

DOI10.1016/0020-0190(94)90063-9zbMATH Open0789.11066OpenAlexW2054528010MaRDI QIDQ1318751FDOQ1318751

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)

Cites Work

• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• On the complexity of finding and counting solution-free sets of integers
• Proof of a conjecture of Kleinberg-Sawin-Speyer

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Estimates related to sumfree subsets of sets of integers 👍 👎
• Sets of integers with no large sum-free subset 👍 👎
• Generalized sum-free subsets 👍 👎

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)