Discrete mathematics/Computability

< Discrete mathematics

Measuring Computational Complexity

Counting Steps

Performance Profiling

Asymptotic Complexity

Big-O Notation

Little-O and Other Notations

Analyzing Asymptotic Complexity

NP-Completeness and Intractability

Uncomputable problems

The Halting Problem

This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.