StringologyTimes

Data Structures and Algorithms: 2007/12/01-07

1: Finding the growth rate of a regular language in polynomial time
2: On Using Unsatisfiability for Solving Maximum Satisfiability