scientific article; zbMATH DE number 7701440

MaRDI QIDQ6161063zbMATH OpenFDO

Authors

Publication date 26 June 2023

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/751/793

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1500663
• scientific article; zbMATH DE number 2044186
• The unpredictable deviousness of models
• The power of random counterexamples
• The power of random counterexamples
• The Power of Negative Thinking in Multiplying Boolean Matrices
• Powerful knockoffs via minimizing reconstructability

Cited in

(1)

• Thinking algorithmically about impossibility (invited talk)

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 Q6161063)