Matches in SemOpenAlex for { <https://semopenalex.org/work/W2905173192> ?p ?o ?g. }
- W2905173192 endingPage "2555" @default.
- W2905173192 startingPage "2527" @default.
- W2905173192 abstract "The CFG recognition problem is as follows: given a context-free grammar $mathcal{G}$ and a string $w$ of length $n$, decide whether $w$ can be obtained from $mathcal{G}$. This is the most basic parsing question and is a core computer science problem. Valiant's parser from 1975 solves the problem in $O(n^{omega})$ time, where $omega<2.373$ is the matrix multiplication exponent. Dozens of parsing algorithms have been proposed over the years, yet Valiant's upper bound remains unbeaten. The best combinatorial algorithms have mildly subcubic $O(n^3/log^3{n})$ time complexity. Evidence for the nonexistence of more efficient algorithms was given in a result of Lee (JACM'01), who showed that any algorithm with running time $O(|mathcal{G}|cdot n^{3-varepsilon})$, which can solve a more general parsing problem in the unusual case that $|mathcal{G}|=Omega(n^6)$, can be converted into a surprising subcubic time algorithm for Boolean Matrix Multiplication. However, nothing was known for the more relevant case of constant size grammars. In this work, we make the first progress on the constant size grammar case in 40 years, and prove that any improvement on Valiant's algorithm, either in terms of runtime or by avoiding the inefficiencies of the known fast matrix multiplication algorithms, would imply a breakthrough algorithm for the $k$-Clique problem: given a graph of $n$ nodes, decide whether there are $k$ nodes that form a clique. Using similar techniques, we derive similar lower bounds for more modern and well-studied cubic time problems for which faster algorithms are highly desirable in practice: RNA Folding, a central problem in computational biology, and Dyck Language Edit Distance, answering an open question of Saha (FOCS'14)." @default.
- W2905173192 created "2018-12-22" @default.
- W2905173192 creator A5044244682 @default.
- W2905173192 creator A5051832024 @default.
- W2905173192 creator A5084855970 @default.
- W2905173192 date "2018-01-01" @default.
- W2905173192 modified "2023-09-26" @default.
- W2905173192 title "If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser" @default.
- W2905173192 cites W1970961429 @default.
- W2905173192 cites W1973113631 @default.
- W2905173192 cites W1981901012 @default.
- W2905173192 cites W1990051509 @default.
- W2905173192 cites W1998156879 @default.
- W2905173192 cites W2007592156 @default.
- W2905173192 cites W2009056959 @default.
- W2905173192 cites W2009147258 @default.
- W2905173192 cites W2010601719 @default.
- W2905173192 cites W2012476164 @default.
- W2905173192 cites W2023867108 @default.
- W2905173192 cites W2025063099 @default.
- W2905173192 cites W2035476608 @default.
- W2905173192 cites W2037633950 @default.
- W2905173192 cites W2040713190 @default.
- W2905173192 cites W2043795882 @default.
- W2905173192 cites W2047092246 @default.
- W2905173192 cites W2047505657 @default.
- W2905173192 cites W2047706513 @default.
- W2905173192 cites W2049216468 @default.
- W2905173192 cites W2064490449 @default.
- W2905173192 cites W2064714768 @default.
- W2905173192 cites W2069488552 @default.
- W2905173192 cites W2070961871 @default.
- W2905173192 cites W2081254453 @default.
- W2905173192 cites W2084732238 @default.
- W2905173192 cites W2125495920 @default.
- W2905173192 cites W2130190334 @default.
- W2905173192 cites W2155978818 @default.
- W2905173192 cites W2166602562 @default.
- W2905173192 cites W2168336253 @default.
- W2905173192 cites W2122472280 @default.
- W2905173192 doi "https://doi.org/10.1137/16m1061771" @default.
- W2905173192 hasPublicationYear "2018" @default.
- W2905173192 type Work @default.
- W2905173192 sameAs 2905173192 @default.
- W2905173192 citedByCount "22" @default.
- W2905173192 countsByYear W29051731922020 @default.
- W2905173192 countsByYear W29051731922021 @default.
- W2905173192 countsByYear W29051731922022 @default.
- W2905173192 countsByYear W29051731922023 @default.
- W2905173192 crossrefType "journal-article" @default.
- W2905173192 hasAuthorship W2905173192A5044244682 @default.
- W2905173192 hasAuthorship W2905173192A5051832024 @default.
- W2905173192 hasAuthorship W2905173192A5084855970 @default.
- W2905173192 hasBestOaLocation W29051731922 @default.
- W2905173192 hasConcept C11413529 @default.
- W2905173192 hasConcept C114614502 @default.
- W2905173192 hasConcept C118615104 @default.
- W2905173192 hasConcept C121332964 @default.
- W2905173192 hasConcept C132525143 @default.
- W2905173192 hasConcept C132569581 @default.
- W2905173192 hasConcept C134306372 @default.
- W2905173192 hasConcept C138885662 @default.
- W2905173192 hasConcept C151730666 @default.
- W2905173192 hasConcept C154945302 @default.
- W2905173192 hasConcept C17349429 @default.
- W2905173192 hasConcept C186644900 @default.
- W2905173192 hasConcept C199360897 @default.
- W2905173192 hasConcept C203776342 @default.
- W2905173192 hasConcept C2777027219 @default.
- W2905173192 hasConcept C2777035058 @default.
- W2905173192 hasConcept C2779343474 @default.
- W2905173192 hasConcept C2779557605 @default.
- W2905173192 hasConcept C2780388253 @default.
- W2905173192 hasConcept C311688 @default.
- W2905173192 hasConcept C33923547 @default.
- W2905173192 hasConcept C41008148 @default.
- W2905173192 hasConcept C41895202 @default.
- W2905173192 hasConcept C43517604 @default.
- W2905173192 hasConcept C62520636 @default.
- W2905173192 hasConcept C77553402 @default.
- W2905173192 hasConcept C84114770 @default.
- W2905173192 hasConcept C86803240 @default.
- W2905173192 hasConceptScore W2905173192C11413529 @default.
- W2905173192 hasConceptScore W2905173192C114614502 @default.
- W2905173192 hasConceptScore W2905173192C118615104 @default.
- W2905173192 hasConceptScore W2905173192C121332964 @default.
- W2905173192 hasConceptScore W2905173192C132525143 @default.
- W2905173192 hasConceptScore W2905173192C132569581 @default.
- W2905173192 hasConceptScore W2905173192C134306372 @default.
- W2905173192 hasConceptScore W2905173192C138885662 @default.
- W2905173192 hasConceptScore W2905173192C151730666 @default.
- W2905173192 hasConceptScore W2905173192C154945302 @default.
- W2905173192 hasConceptScore W2905173192C17349429 @default.
- W2905173192 hasConceptScore W2905173192C186644900 @default.
- W2905173192 hasConceptScore W2905173192C199360897 @default.
- W2905173192 hasConceptScore W2905173192C203776342 @default.
- W2905173192 hasConceptScore W2905173192C2777027219 @default.
- W2905173192 hasConceptScore W2905173192C2777035058 @default.