Deterministic Algorithms
€21
https://schema.org/InStock
eur
OlineNino
Goal To prove that the
algorithm solves the problem
correctly always and quickly
typically the number of steps
should be polynomial in the
size of the input
Size
183 KB
Length
40 pages
Add to wishlist