On Hard Instances of Non-Commutative Permanent (Q2817859): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2498618480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits and the Hadamard Product of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of the noncommutative determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quaternionic determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithmic Results for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncommutativity Makes Determinants Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras with Polynomial Identities and Computing the Determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity, Determinants, Permanents, and (Unique) Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2830870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small space analogues of Valiant's classes and the limitations of skew 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: Feasible arithmetic computations: Valiant's hypothesis / rank
 
Normal rank

Latest revision as of 12:01, 12 July 2024

scientific article
Language Label Description Also known as
English
On Hard Instances of Non-Commutative Permanent
scientific article

    Statements

    On Hard Instances of Non-Commutative Permanent (English)
    0 references
    0 references
    0 references
    2 September 2016
    0 references

    Identifiers

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