Theoretical
- 129
- Vardi, Moshe Y.
- Recent paper on the hardness of random formulas for SAT solver; bounded tree-width.
- 136
- Complexity and Approximation
- Combinatorial optimization problems and their approximability properties: by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi (Springer, 1999). Table of contents, errata, software supplement and a continuously updated catalog of approximability results.
- 137
- Context-Free Grammars and Parsing
- An article defining the grammar and how Binary Normal Form (BNF) is used to parse words in a context free language. An example shows how operator precedence is preserved in a context free grammar.
- 138
- Context-free Grammar
- A Wikipedia article that defines context free grammars and uses them to generate context free languages.