scientific article; zbMATH DE number 808806

MaRDI QIDQ4852855zbMATH OpenFDO

Authors Aleksej Dmitrievich Korshunov

Publication date 17 March 1996

zbMATH Keywords

arithmetical progressionscomplexitydiscrete covering

Mathematics Subject Classification ID

Extremal set theory (05D05) Arithmetic progressions (11B25) Combinatorial probability (60C05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3902673
• scientific article; zbMATH DE number 881169
• Random minimal coverings of sets
• Covering sets by subsets
• Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]

Cited in

(4)

• An upper bound for the complexity of linearized coverings in a finite field
• Covering an arithmetic progression with geometric progressions and vice versa
• Covering numbers: Arithmetics and dynamics for rotations and interval exchanges
• Covering a set with arithmetic progressions is NP-complete

This page was built for publication:

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