The following pages link to (Q5639707):
Displaying 9 items.
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- The reachability problem for Petri nets and decision problems for Skolem arithmetic (Q1148890) (← links)
- The equivalence of Horn and network complexity for Boolean functions (Q1160604) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- Path constraints in semistructured databases (Q1591150) (← links)
- Satisfiability of the smallest binary program (Q2366070) (← links)
- Prefix classes of krom formulae with identity (Q3956908) (← links)
- Diem-Grade Logischer Entscheidungsprobleme (Q4135479) (← links)
- Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen (Q4401927) (← links)