A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:16, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing |
scientific article |
Statements
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (English)
0 references
3 September 2015
0 references
ABC conjecture
0 references
Lang-Waldschmidt conjecture
0 references
succinct representation of numbers
0 references
arithmetic circuits
0 references
logarithmic forms
0 references
probabilistic parsing
0 references
stochastic context-free grammars
0 references
