{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, an **evasive Boolean function** $f$ (of $n$ variables) is a [[Boolean function|0A58THH5XV]] for which every decision tree algorithm has running time of exactly $n$. Consequently, every decision tree algorithm that represents the function has, at worst case, a running time of $n$.\n",
  "commit": "1696dfa6ac9eeb239262bb8121a4817855ba7e8d",
  "front": {
    "inventory": [
      "QHZJEPY32S"
    ],
    "kind": "concept",
    "name": "Evasive Boolean function",
    "same_as": {
      "wikidata": "Q5416097",
      "wikipedia": "Evasive Boolean function"
    },
    "sources": [
      {
        "locator": "Evasive Boolean function",
        "mention": "wikipedia://en/26006899",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:26006899@r1337262166"
      }
    ],
    "tag": "PGZ13VYQWN"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/PGZ13VYQWN/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/PGZ13VYQWN.md",
  "msc": null,
  "name": "Evasive Boolean function",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PGZ/PGZ13VYQWN.md",
  "status": null,
  "tag": "PGZ13VYQWN",
  "uri": "m2://PGZ13VYQWN",
  "url": "https://math2.tamnd.com/wiki/evasive-boolean-function/",
  "writing": {
    "tag": "PGZ13VYQWN",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}