Approximate answer set counting enables counting minimal trap spaces and fixed points in Boolean networks up to 5000 variables.
SAT competition 2017--solver and benchmark descriptions, 2017
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
Approximate answer set counting enables counting minimal trap spaces and fixed points in Boolean networks up to 5000 variables.