Searching for authors named "Howard Straubing" – sorted by Relevance.
-
Circuit Complexity and the Expressive Power of Generalized First-Order Formulas
- Circuit Complexity and the Expressive Power of Generalized First-Order Formulas Howard Straubing
- Cited by 1 (0 self) – Add To MetaCart
-
Languages Defined With Modular Counting Quantifiers
- Languages Defined With Modular Counting Quantifiers Howard Straubing Computer Science Department
- Cited by 2 (1 self) – Add To MetaCart
-
Inexpressibility Results for Regular Languages in Nonregular Settings
- Inexpressibility Results for Regular Languages in Nonregular Settings Howard Straubing Computer
- Add To MetaCart
-
The Power of Local Self-Reductions
- The Power of Local Self-Reductions Richard Beigel Yale University Howard Straubing y Boston
- Cited by 3 (0 self) – Add To MetaCart
-
Modular Quantifiers
- Modular Quantifiers Howard Straubing1 2 ∗ Denis Thérien 1 Computer Science Department Boston
- Add To MetaCart
-
First order formulas with modular predicates
- -Eric.Pin@(email omitted); Howard Straubing Department of Computer Science, Boston College, Chestnut Hill, MA 02467, USA straubin
- Cited by 3 (0 self) – Add To MetaCart
-
Weakly Iterated Block Products of Finite Monoids
- Weakly Iterated Block Products of Finite Monoids Howard Straubing 1 and Denis Therien 2? 1
- Cited by 5 (2 self) – Add To MetaCart
-
Definability of Languages by Generalized First-Order Formulas over (N
- Definability of Languages by Generalized First-Order Formulas over (N,+) Amitabha Roy and Howard
- Cited by 4 (1 self) – Add To MetaCart
-
Piecewise testable tree languages
- Piecewise testable tree languages Mikołaj Bojańczyk Luc Segoufin Howard Straubing Warsaw
- Add To MetaCart
-
A Note on MOD p - MOD m Circuits
- A Note on MOD p - MOD m Circuits Howard Straubing 1 and Denis Th'erien 2 1 Computer Science
- Add To MetaCart

