Lower bounds for tropical circuits and dynamic programs (Q493653): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Stasys P. Jukna / rank
Normal rank
 
Property / author
 
Property / author: Stasys P. Jukna / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987315863 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1406.3065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of linear sized tolerant networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining efficient lower bounds for monotone complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtraction-free complexity, cluster transformations, and spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of calculation of differentials and gradients / 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: Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> / 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: Ramanujan local systems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders and time-restricted branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the incompressibility of monotone DNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Boolean sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone switching circuits and Boolean matrix product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of monotone networks for Boolean matrix product / 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: Lower bounds on monotone complexity of the logical permanent / 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: 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: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic Equivalences Between Path, Matrix, and Triangle Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 17:05, 10 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for tropical circuits and dynamic programs
scientific article

    Statements

    Lower bounds for tropical circuits and dynamic programs (English)
    0 references
    4 September 2015
    0 references
    tropical circuits
    0 references
    dynamic programming
    0 references
    monotone arithmetic circuits
    0 references
    lower bounds
    0 references
    0 references
    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