output
20072014
most citedImproved Analysis of Kannan's Shortest Lattice Vector Algorithm

136 citations

researchers with a paper here
collaborating institutions
Showing cs.CLShow all

1 paper · 1 filter

cs.CL2013★ 6 cited

Non-simplifying Graph Rewriting Termination

Guillaume Bonfante, Bruno Guillaume

So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's wo…