scientific article; zbMATH DE number 866556

MaRDI QIDQ4873585zbMATH OpenFDO

Authors Erich Novak

Publication date 16 April 1996

zbMATH Keywords

combinatorial complexitycomputational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computational complexity of continuous problems
• Randomization for continuous problems
• Continuous problems: optimality, complexity, tractability (invited talk)
• scientific article; zbMATH DE number 50734

Cited in

(9)

• Randomization for continuous problems
• Open problems around exact algorithms
• Computational complexity of continuous problems
• scientific article; zbMATH DE number 50734 (Why is no real title available?)
• scientific article; zbMATH DE number 1512671 (Why is no real title available?)
• scientific article; zbMATH DE number 1859218 (Why is no real title available?)
• Some Aspects of a Complexity Theory for Continuous Time Systems
• Guest editors' preface
• Guest editors' preface

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