2 citations · 2 across the 1 of their papers we have counts for
1 paper
Sergey Fomin, Dima Grigoriev, Dorian Nogneng +1
Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed…