sarah-marie belcastro
Abstract
This topic is very important in practice: paying attention to the computational complexity of an algorithm as it’s being designed can make the difference between a program that won’t finish before the universe ends and a program that finishes in an hour or two.
OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This topic is very important in practice: paying attention to the computational complexity of an algorithm as it’s being designed can make the difference between a program that won’t finish before the universe ends and a program that finishes in an hour or two.
Key concepts: Computer science, Computational complexity theory, Mathematics, Theoretical computer science, Discrete mathematics, Algorithm