activity
20162023
most citedNondeterminism and an abstract formulation of Nečiporuk's lower bound method

3 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.CC2019

The Power of Programs over Monoids in J and Threshold Dot-depth One Languages

Nathan Grosshans

The model of programs over (finite) monoids, introduced by Barrington and Thérien, gives an interesting way to characterise the circuit complexity class and its sub…