Construct · 1 fields · 1 citations

minimum circuit size problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
minimum circuitsize problem1 CONSTRUCTMinimum circuit sizeKABANETS · COMPUTATIONAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the problem of deciding whether a function given by its truth table has a circuit below a given size, whose hardness status is a central open question.

In computational complexity, minimum circuit size problem refers to the problem of deciding whether a function given by its truth table has a circuit below a given size, whose hardness status is a central open question. This meaning comes from Kabanets (2000) in Proceedings of the thirty-second annual ACM symposium on Theory of computing.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how minimum circuit size problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

circuit1 fields · 1 citationsanchor · a standalone constructcomplexity4 fields · 7 citationsjingle · one word, four constructsfunction5 fields · 6 citationsjingle · one word, five constructs

References

  1. Kabanets, V., & Cai, J. (2000). Circuit minimization problem. Proceedings of the thirty-second annual ACM symposium on Theory of computing. https://doi.org/10.1145/335305.335314

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct