Pages that link to "Item:Q1313762"
From MaRDI portal
The following pages link to A linear time algorithm for unique Horn satisfiability (Q1313762):
Displaying 8 items.
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- A linear algorithm for renaming a set of clauses as a Horn set (Q1318709) (← links)
- The unique Horn-satisfiability problem and quadratic Boolean equations. (Q1353999) (← links)
- Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
- Unique satisfiability of Horn sets can be solved in nearly linear time (Q1894352) (← links)
- (Q3124320) (← links)