scientific article; zbMATH DE number 6862129

DOI10.4230/LIPICS.STACS.2017.37zbMATH Open1402.68095arXiv1607.05494MaRDI QIDQ4636636FDOQ4636636

Ignacio García Marco, Pascal Koiran, Stéphan Thomassé, Timothée Pecatte

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1607.05494

Title of this publication is not available (Why is that?)

zbMATH Keywords

simplicial complexlower boundsarithmetic circuitscounting complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of simplicial complexes (05E45)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Leibniz complexity of Nash functions on differentiations
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
• Title not available (Why is that?)
• Deterministic polynomial identity testing in non-commutative models

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 Q4636636)