| J94-2002 | consequences will then be drawn for the | tree-adjoining grammar parsing | problem . The following analysis |
| J94-2002 | have related the complexity of | tree-adjoining grammar parsing | to the complexity of Boolean |
| J94-2002 | understand which features of the | tree-adjoining grammar parsing | problem are responsible for the |
| J94-2002 | improves the known upper bound for | tree-adjoining grammar parsing | is hard to find . Second , we |
| J94-2002 | multiplication problem is related to the | tree-adjoining grammar parsing | problem , establishing the major |
| J94-2002 | of the adjunction operation in | tree-adjoining grammar parsing | . As already mentioned in the |
| J94-2002 | his judicious comments . <title> | Tree-Adjoining Grammar Parsing | and Boolean Matrix Multiplication |
| J94-2002 | method for the solution of the | tree-adjoining grammar parsing | problem having running time 0 |
| J94-2000 | Probabilistic Bernard Merialdo 155 Model | Tree-Adjoining Grammar Parsing | and Boolean Giorgio Satta 173 |
