The following pages link to Theoretical Computer Science (Q5897360):
Displaying 4 items.
- Random walks for selected Boolean implication and equivalence problems (Q1014275) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- Absorbing random walks and the NAE2SAT problem (Q5391499) (← links)