NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Boolean Satisfiability Algorithms and Solvers

Development of practical and theoretical SAT solving algorithms including DPLL variants, clause learning, and stochastic methods.