Pages that link to "Item:Q2821448"
From MaRDI portal
The following pages link to Optimal partial-order plan relaxation via MaxSAT (Q2821448):
Displaying 5 items.
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets (Q2224808) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- Proofs and Certificates for Max-SAT (Q5870516) (← links)
- Max-SAT with cardinality constraint parameterized by the number of clauses (Q6547959) (← links)