Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10208-014-9231-y / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q105613658 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TNTool / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976802094 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.8425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrizations of canonical bases and totally positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing Schur functions and series thereof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separated set-systems and their geometric models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the singular value decomposition with high relative accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate and efficient evaluation of Schur and Jack functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster algebras I: Foundations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new tableau representation for supersymmetric Schur functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds in algebraic computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Null- and Positivstellensatz proofs / 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: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate Computations with Totally Nonnegative Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Idempotent and tropical mathematics; complexity of algorithms and interval analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schur functions: Theme and variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comultiplication rules for the double Schur functions and Cauchy identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542181 / 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: Arithmetic Circuits: A survey of recent results and open questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4389325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation can be exponentially powerful / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid inequalities from electrical network theory / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10208-014-9231-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:33, 9 December 2024

scientific article; zbMATH DE number 6549969
Language Label Description Also known as
English
Subtraction-free complexity, cluster transformations, and spanning trees
scientific article; zbMATH DE number 6549969

    Statements

    Subtraction-free complexity, cluster transformations, and spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2016
    0 references
    subtraction-free complexity
    0 references
    arithmetic circuit
    0 references
    Schur function
    0 references
    spanning tree
    0 references
    cluster transformation
    0 references
    star-mesh transformation
    0 references
    0 references
    0 references
    0 references
    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
    0 references