A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing (Q2943574)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing |
scientific article; zbMATH DE number 6478366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing |
scientific article; zbMATH DE number 6478366 |
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
0 references
0 references
0.6886464357376099
0 references
0.6695513129234314
0 references
0.6655334830284119
0 references
0.6654783487319946
0 references
