Skip to main content
Proof Assistants Beta

About

Ask Question
Tag Info
Info Newest Frequent Score Active Unanswered

Computational complexity is a measure of the amount of time (computational steps) or space that it takes for an algorithm to solve a particular problem. Use this tag above the complexity of theorem proving algorithms.

There is no tag wiki for this tag … yet!

Tag wikis help introduce newcomers to the tag. They contain an overview of the topic defined by the tag, along with guidelines on its usage.

All registered users may propose new tag wikis.

(Note that if you have less than 4000 reputation, your tag wiki will be peer reviewed before it is published.)

History Excerpt history