pith. sign in

Title resolution pending

Philippe Flajolet · 1987 · DOI 10.1016/0304-3975(87)90011-9

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.LO 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Automatic constraint satisfaction problem

cs.LO · 2026-04-21 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Automatic constraint satisfaction problem cs.LO · 2026-04-21 · unverdicted · none · ref 18

    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.