Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Explicit construction of exponential sized families of k-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Derivatives in Arithmetic Complexity and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sidon sets in \(\mathbb N^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of two others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3695347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Sidon in Additive Number Theory, and on some Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of tropical Schur polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous formulas and symmetric polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parallel Evaluation of Multivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Exact Complexity Results for Straight-Line Computations over Semirings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for tropical circuits and dynamic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-graphs and bipartite Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of two vectors from the sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(B_ 2\)-sequences of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete annotated bibliography of work related to Sidon sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On another Boolean matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of additions in monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for monotone arithmetic circuits computing \(0-1\) permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the depth complexity of formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits: A survey of recent results and open questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct version of Shamir and Snir's lower bounds on monotone circuit depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation can be exponentially powerful / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/16m1064738 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2548334940 / rank
 
Normal rank

Latest revision as of 09:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Tropical Complexity, Sidon Sets, and Dynamic Programming
scientific article

    Statements

    Tropical Complexity, Sidon Sets, and Dynamic Programming (English)
    0 references
    11 November 2016
    0 references
    tropical circuits
    0 references
    arithmetic circuits
    0 references
    dynamic programming
    0 references
    cover-free sets
    0 references
    Sidon sets
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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