Construct · 1 fields · 1 citations

evasiveness conjecture: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed

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 conjecture that every nontrivial monotone graph property requires querying all possible edges in the worst case.

In computational complexity, evasiveness conjecture refers to the conjecture that every nontrivial monotone graph property requires querying all possible edges in the worst case. This meaning comes from Rivest (1976) in Theoretical Computer Science.[1]

Unit
Recovery means
Measured by

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

See how evasiveness conjecture sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

case2 fields · 3 citationsjingle · one word, two constructs complexity4 fields · 7 citationsjingle · one word, four constructs property4 fields · 4 citationsjingle · one word, four constructs

References

Rivest, R. L., & Vuillemin, J. (1976). On recognizing graph properties from adjacency matrices. Theoretical Computer Science, 3(3), 371-384. https://doi.org/10.1016/0304-3975(76)90053-0

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