Nathan Grosshans

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 2021Show all

2 papers · 1 filter

cs.FL2021

A Note on the Join of Varieties of Monoids with LI

Nathan Grosshans

In this note, we give a characterisation in terms of identities of the join of $V$ with the variety of finite locally trivial semigroups $LI$ for several well-kno…

cs.CC2021★ 1 cited

Tameness and the power of programs over monoids in DA

Nathan Grosshans, Pierre Mckenzie, Luc Segoufin

The program-over-monoid model of computation originates with Barrington's proof that the model captures the complexity class $N C^{1}$ . Here we make progress in understanding…