scientific article; zbMATH DE number 2196509
From MaRDI portal
Publication:5465356
Recommendations
Cited in
(26)- Better complexity bounds for cost register automata
- The power word problem in graph products
- Emptiness problems for integer circuits
- Descriptive complexity of \#P functions: a new perspective
- On the complexity of matrix rank and rigidity
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- Complexity of regular functions
- Characterizing Valiant's algebraic complexity classes
- On the power of algebraic branching programs of width two
- Monomials, multilinearity and identity testing in simple read-restricted circuits
- Cost register automata for nested words
- On the power of algebraic branching programs of width two
- A Logspace Algorithm for Partial 2-Tree Canonization
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
- scientific article; zbMATH DE number 4008288 (Why is no real title available?)
- The parallel complexity of graph canonization under abelian group action
- Arithmetic and Algebraic Circuits
- \(\mathrm{AC}^0[p]\) lower bounds against MCSP via the coin problem
- Better complexity bounds for cost register automata
- scientific article; zbMATH DE number 7204408 (Why is no real title available?)
- The Space Complexity of k-Tree Isomorphism
- The power word problem in graph products
- Optimal traitor tracing from pairings
- Root finding with threshold circuits
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\)
- Positive and negative proofs for circuits and branching programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465356)
