Pages that link to "Item:Q5445331"
From MaRDI portal
The following pages link to On the Complexity of Computing Generators of Closed Sets (Q5445331):
Displaying 7 items.
- On a complete set of generators for dot-depth two (Q1324687) (← links)
- NP-completeness of small conflict set generation for congruence closure (Q1688538) (← links)
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset (Q2671748) (← links)
- Unique key Horn functions (Q2672584) (← links)
- LoCo—A Logic for Configuration Problems (Q2946729) (← links)
- Closure via functional dependence simplification (Q4903555) (← links)
- A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets (Q4910822) (← links)