scientific article; zbMATH DE number 2196509
From MaRDI portal
Publication:5465356
zbMath1098.68049MaRDI QIDQ5465356
Publication date: 22 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Monomials, multilinearity and identity testing in simple read-restricted circuits, The power word problem in graph products, The parallel complexity of graph canonization under abelian group action, Emptiness problems for integer circuits, A Logspace Algorithm for Partial 2-Tree Canonization, Positive and negative proofs for circuits and branching programs, Complexity of regular functions, Descriptive complexity of \#P functions: a new perspective, The Space Complexity of k-Tree Isomorphism, On the Power of Algebraic Branching Programs of Width Two, Root finding with threshold circuits, Characterizing Valiant's algebraic complexity classes, Better complexity bounds for cost register automata, On the complexity of matrix rank and rigidity, Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae, Unnamed Item, Unnamed Item, Cost Register Automata for Nested Words, Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\), Better complexity bounds for cost register automata, Monomials in arithmetic circuits: complete problems in the counting hierarchy, On the power of algebraic branching programs of width two
