pith. sign in

Title resolution pending

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

citation-role summary

dataset 1

citation-polarity summary

fields

cs.AI 2 cs.CV 1

roles

dataset 1

polarities

use dataset 1

clear filters

representative citing papers

Formal Verification of Minimax Algorithms

cs.AI · 2025-09-24 · accept · novelty 7.0

The authors formally verify several minimax variants with alpha-beta and transposition tables in Dafny, proving one depth-limited negamax variant correct under a new witness-based criterion and exhibiting a counterexample for another.

Minimax Strikes Back

cs.AI · 2020-12-19 · unverdicted · novelty 5.0

Athénan, a minimax-based zero-knowledge RL method without a policy, achieves 296 times lower state-data cost and at least 7 times higher speed than Polygames on multiple games.

citing papers explorer

Showing 1 of 1 citing paper after filters.