A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic forms and group varieties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring into coprimes in essentially linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biological Sequence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3527019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minorations de Combinaisons Linéaires de Logarithmes de Nombres Algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4655973 / rank
 
Normal rank

Latest revision as of 17:02, 10 July 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references