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.
Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, and Ross Willard
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.