TAL recognition in \(O(M(n^2))\) time (Q1267714): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree adjunct grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical methods in linguistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Adjoining Language Parsing in $O(n^6 )$ Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: General context-free recognition in less than cubic time / rank
 
Normal rank

Latest revision as of 15:42, 28 May 2024

scientific article
Language Label Description Also known as
English
TAL recognition in \(O(M(n^2))\) time
scientific article

    Statements

    Identifiers