Judit Nagy-György

most citedOn nonpermutational transformation semigroups with an application to syntactic complexity

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

collaborators

Showing cs.FLShow all

2 papers · 1 filter

cs.FL2014

Biclique coverings, rectifier networks and the cost of $ε$ -removal

Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György +2

We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number $Cov (G)$ and the minimal rectifier network size $Rect (G)$ of a b…

cs.FL2014★ 5 cited

On nonpermutational transformation semigroups with an application to syntactic complexity

Szabolcs Ivan, Judit Nagy-Gyorgy

We give an upper bound of $n ((n - 1)! - (n - 3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutat…

Biclique coverings, rectifier networks and the cost of ε-removal

On nonpermutational transformation semigroups with an application to syntactic complexity

Biclique coverings, rectifier networks and the cost of $ε$ -removal