Linear circuits, two-variable logic and weakly blocked monoids | 8 | 0.67 | 2013 |
The lower reaches of circuit uniformity | 2 | 0.39 | 2012 |
Low uniform versions of NC1. | 1 | 0.36 | 2011 |
Typed Monoids - An Eilenberg-like Theorem for non regular Languages | 3 | 0.45 | 2011 |
Regular Languages in MAJ[>] with three variables. | 0 | 0.34 | 2011 |
Practical Graph Isomorphism for Graphlet Data Mining in Protein Structures | 0 | 0.34 | 2010 |
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] | 3 | 0.42 | 2009 |
Regular Languages Definable by Majority Quantifiers with Two Variables | 3 | 0.44 | 2009 |
An Approach to characterize the Regular Languages in TC0 with Linear Wires | 0 | 0.34 | 2009 |
FO[<]-Uniformity | 3 | 0.40 | 2006 |