AutCSPs allow polynomial-time polymorphism verification and extend Schaefer's dichotomy to Boolean domains with tractability decision procedures for automatic polymorphisms on succinct automata representations.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
citing papers explorer
-
Automatic constraint satisfaction problem
AutCSPs allow polynomial-time polymorphism verification and extend Schaefer's dichotomy to Boolean domains with tractability decision procedures for automatic polymorphisms on succinct automata representations.
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.