Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Straubing, Howard - Computer Science Department, Boston College
Lower Bounds for Modular Counting by Circuits with Modular Gates
When Can One Finite Monoid Simulate Howard Straubing
Weakly Iterated Block Products of Finite Howard Straubing and Denis Th erien
Regular Languages De ned by Generalized First-Order Formulas with a Bounded Number
Languages Defined With Modular Counting Quantifiers
COMPLEX POLYNOMIALS AND CIRCUIT LOWER BOUNDS FOR MODULAR COUNTING
Circuit Complexity and the Expressive Power of Generalized FirstOrder Formulas
LOGICS FOR REGULAR LANGUAGES, FINITE MONOIDS, AND CIRCUIT COMPLEXITY
The Power of Local SelfReductions Richard Beigel \Lambda
SUPERLINEAR LOWER BOUNDS FOR BOUNDEDWIDTH BRANCHING PROGRAMS
