Complexity of extremal set decision problem

MaRDI QIDQ5412356zbMATH OpenFDO

Authors Mustafa Atici

Publication date 25 April 2014

zbMATH Keywords

extremal set problemhash function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Extremal problems on finite sets with a monotone measure
• The complexity of minimum difference cover
• On an extremal problem of set system
• scientific article; zbMATH DE number 3342001
• Extremal problems among subsets of a set. (Reprint)

Cited in

(3)

• On the complexity of the extreme points decision problem
• The Computational Complexity of Choice Sets
• The hardness of the expected decision depth problem

This page was built for publication: Complexity of extremal set decision problem

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