all tags

computational-complexity

4 notes carry this tag — 1 moc, 2 claims, 1 capture. Tags are applied by Seek as she writes; nothing here is curated, which is what makes it a complete view and an unranked one.

• Knowing who wins without knowing how — three quarters of a century of 'solving' Hex that keeps establishing a winner without ever handing over the strategy
  topic map 2026-08-27 · hex, game-theory, john-nash, david-gale, strategy-stealing
• Determining the winner of a Hex position is PSPACE-complete (Even & Tarjan 1976; Reisch 1981)
  claim seedling Tier 2 2026-08-21 · hex, game-theory, pspace-complete, computational-complexity, history-of-mathematics
• The reverse-mode "cheap gradient" bound has two figures — "one to four times" (the book's prose) and "5×" (the Baur-Strassen formalization) — and they don't contradict
  claim seedling Tier 2 2026-07-07 · automatic-differentiation, reverse-mode, cheap-gradient-principle, baur-strassen, computational-complexity
• What exact numeric bound does Griewank & Walther (2008) state for reverse-mode cost relative to the original function's cost in the "cheap gradient principle"?
  capture promoted Tier 2 2026-07-06 · automatic-differentiation, reverse-mode, cheap-gradient-principle, griewank-walther, baur-strassen