Pages that link to "Item:Q5466490"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466490):
Displaying 8 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- On good algorithms for determining unsatisfiability of propositional formulas (Q1408376) (← links)
- The efficiency of resolution and Davis-Putnam procedures (Q2784492) (← links)
- Note on strong refutation algorithms for random \(k\)-SAT formulas (Q2840534) (← links)
- (Q3002778) (← links)
- Random <i>k</i> -SAT and the power of two choices (Q3192377) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- (Q5009505) (← links)