scientific article
From MaRDI portal
Publication:2904776
DOI10.4230/LIPIcs.STACS.2012.362zbMath1245.68087MaRDI QIDQ2904776
Stefan Mengel, Guillaume Malod, Hervé Fournier
Publication date: 23 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
Monomials, multilinearity and identity testing in simple read-restricted circuits ⋮ On enumerating monomials and other combinatorial structures by polynomial interpolation ⋮ Algebraic independence in positive characteristic: A $p$-adic calculus ⋮ Building above read-once polynomials: identity testing and hardness of representation ⋮ Algebraic Complexity Classes ⋮ Monomials in arithmetic circuits: complete problems in the counting hierarchy
This page was built for publication:
