Math 2.0

Areas Theory of computation Topic

Average-case complexity and total search problems

Summary

This topic is a part of theory of computation. It covers hardness on random inputs, the classification of total search problems by the existence theorem behind them, and the complexity of finding equilibria.

About this page
TagC87MR0GDZ0
URIm2://C87MR0GDZ0
Kindtopic
WritingW0 stub
MSC68Q17, 68Q87, 91A68
Part ofTheory of computation
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.