Parsing by matrix multiplication generalized to Boolean grammars (Q385966): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.09.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2156495052
@@ Property / OpenAlex ID: W2156495052 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved time and space bounds for Boolean matrix multiplication
+Normal rank
@@ Property / cites work @@
+Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
+Normal rank
@@ Property / cites work @@
+Q5616735
@@ Property / cites work: Q5616735 / rank @@
+Normal rank
@@ Property / cites work @@
+Membership problems for regular and context-free trace languages
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
+Normal rank
@@ Property / cites work @@
+Complexity of equations over sets of natural numbers
+Normal rank
@@ Property / cites work @@
+BOOLEAN FUZZY SETS
@@ Property / cites work: BOOLEAN FUZZY SETS / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-founded semantics for Boolean grammars
@@ Property / cites work: Well-founded semantics for Boolean grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Fast context-free grammar parsing requires fast boolean matrix multiplication
+Normal rank
@@ Property / cites work @@
+Q4531380
@@ Property / cites work: Q4531380 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean grammars
@@ Property / cites work: Boolean grammars / rank @@
+Normal rank
@@ Property / cites work @@
+GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
+Normal rank
@@ Property / cites work @@
+Recursive descent parsing for Boolean grammars
@@ Property / cites work: Recursive descent parsing for Boolean grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Unambiguous Boolean grammars
@@ Property / cites work: Unambiguous Boolean grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Conjunctive and Boolean grammars: the true general case of the context-free grammars
+Normal rank
@@ Property / cites work @@
+Parsing Boolean grammars over a one-letter alphabet using online convolution
+Normal rank
@@ Property / cites work @@
+TAL recognition in \(O(M(n^2))\) time
@@ Property / cites work: TAL recognition in \(O(M(n^2))\) time / rank @@
+Normal rank
@@ Property / cites work @@
+Context-free recognition via shortest paths computation: a version of Valiant's algorithm
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+General context-free recognition in less than cubic time
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / cites work @@
+Q2934692
@@ Property / cites work: Q2934692 / rank @@
+Normal rank