Name
Abstract | ||
|---|---|---|
Recent developments on the complexity of the non-commutative determinant and permanent (Arvind and Srinivasan, 2010; Chien et al., 2011; Bläser, 2013; Gentry, 2014) have settled the complexity of non-commutative determinant with respect to the structure of the underlying algebra. Continuing the research further, we look to obtain more insights on hard instances of non-commutative permanent. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.dam.2019.09.003 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Arithmetic circuit complexity,Non-commutative,Permanent | Discrete mathematics,Combinatorics,Disjoint sets,Commutative property,Vertex (geometry),Polynomial,Permutation,P-complete,Connected component,Computing the permanent,Mathematics | Journal |
Volume | Issue | ISSN |
277 | C | 0166-218X |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Engels | 1 | 10 | 3.95 |
| B. V. Raghavendra Rao | 2 | 53 | 13.86 |