Publication:5111247

DOI10.4230/LIPIcs.MFCS.2017.33zbMath1441.68064MaRDI QIDQ5111247

Christian Glaßer, Dominik Barth, Marc Technau, Moritz Beck, Titus Dose, Larissa Michler

Publication date: 26 May 2020

zbMATH Keywords

computational complexity; polynomial identity testing; integer expressions; integer circuits

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q06: Networks and circuits as models of computation; circuit complexity