Noncommutativity makes determinants hard (Q2347802): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.ic.2014.12.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053708783 / 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: Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Cover Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximability of the cover polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost settling the hardness of noncommutative determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clifford algebras and approximating the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Time Complexity of the Permanent and the Tutte Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4300259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient decomposition of associative algebras over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient decomposition of separable algebras. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Levi decompositions in Lie algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte-Carlo Algorithm for Estimating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant: Old Algorithms, New Insights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent via Nonabelian Determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:21, 10 July 2024

scientific article
Language Label Description Also known as
English
Noncommutativity makes determinants hard
scientific article

    Statements

    Noncommutativity makes determinants hard (English)
    0 references
    0 references
    9 June 2015
    0 references
    counting complexity
    0 references
    determinant
    0 references
    permanent
    0 references
    associative algebras
    0 references

    Identifiers