On the arithmetic complexity of Euler tours
From MaRDI portal
Cites work
- Almost settling the hardness of noncommutative determinant
- Bounded treewidth and space-efficient linear algebra
- Completeness and reduction in algebraic complexity theory
- Counting Euler tours in undirected bounded treewidth graphs
- scientific article; zbMATH DE number 7250152 (Why is no real title available?)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
- Lower bounds for non-commutative skew circuits
- Lower bounds on arithmetic circuits via partial derivatives
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
- Non-commutative circuits and the sum-of-squares problem
- Noncommutative Valiant's classes: structure and complete problems
- Noncommutativity makes determinants hard
- On hard instances of non-commutative permanent
- On lifting lower bounds for noncommutative circuits using automata
- On the hardness of the noncommutative determinant
- On the number of Eulerian orientations of a graph
- On Unicursal Paths in a Network of Degree 4
- The complexity of counting Eulerian tours in 4-regular graphs
This page was built for publication: On the arithmetic complexity of Euler tours
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442716)