Algorithmics

MaRDI QIDQ2756798zbMATH OpenFDO

Authors Uwe Schöning

Publication date 19 November 2001

zbMATH Keywords

data compressiondynamical programminggreedy algorithm

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of data (68P01) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2237397
• Algorithms and data structures
• Algorithms and data structures
• scientific article; zbMATH DE number 1552764
• Algorithms and data structures. Basics and probabilistic methods for design and analysis

Cited in

(5)

• Complexity theory. Limits of the efficiency of algorithms
• scientific article; zbMATH DE number 1024633 (Why is no real title available?)
• Algorithms and data structures. Basics and probabilistic methods for design and analysis
• scientific article; zbMATH DE number 958772 (Why is no real title available?)
• A Kolmogorov complexity proof of the Lovász local lemma for satisfiability

This page was built for publication: Algorithmics

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