On the power of the congested clique model
We study the computation power of the congested clique, a model of distributed computation
where n players communicate with each other over a complete network in order to compute …
where n players communicate with each other over a complete network in order to compute …
Amplifying lower bounds by means of self-reducibility
We observe that many important computational problems in NC1 share a simple self-
reducibility property. We then show that, for any problem A having this self-reducibility …
reducibility property. We then show that, for any problem A having this self-reducibility …
Logic meets algebra: the case of regular languages
P Tesson, D Thérien - Logical Methods in Computer Science, 2007 - lmcs.episciences.org
The study of finite automata and regular languages is a privileged meeting point of algebra
and logic. Since the work of Buchi, regular languages have been classified according to …
and logic. Since the work of Buchi, regular languages have been classified according to …
Resilience for Regular Path Queries: Towards a Complexity Classification
The resilience problem for a query and an input set or bag database is to compute the
minimum number of facts to remove from the database to make the query false. In this paper …
minimum number of facts to remove from the database to make the query false. In this paper …
Quivers of monoids with basic algebras
We compute the quiver of any finite monoid that has a basic algebra over an algebraically
closed field of characteristic zero. More generally, we reduce the computation of the quiver …
closed field of characteristic zero. More generally, we reduce the computation of the quiver …
Lower bounds for circuits with MOD_m gates
Let CC o (n)[m] be the class of circuits that have size o (n) and in which all gates are MOD
[m] gates. We show that CC [m] circuits cannot compute MOD q in sub-linear size when m …
[m] gates. We show that CC [m] circuits cannot compute MOD q in sub-linear size when m …
Production deployment of a fast transient testing methodology for analog circuits: Case study and results
R Voorakaranam, R Newby, S Cherubal… - … Test Conference, 2003 …, 2003 - computer.org
Abstract Barrington, Straubing and Therien (1990) conjectured that the Boolean AND
function can not be computed by polynomial size constant depth circuits built from modular …
function can not be computed by polynomial size constant depth circuits built from modular …
A New Characterization of ACC0 and Probabilistic CC0
Barrington, Straubing & Thérien (1990) conjectured that the Boolean A nd function can not
be computed by polynomial size constant depth circuits built from modular counting gates …
be computed by polynomial size constant depth circuits built from modular counting gates …
Circuit lower bounds via Ehrenfeucht-Fraisse games
M Koucky, S Poloczek, C Lautemann… - 21st Annual IEEE …, 2006 - ieeexplore.ieee.org
In this paper we prove that the class of functions expressible by first order formulas with only
two variables coincides with the class of functions computable by AC/sup 0/circuits with a …
two variables coincides with the class of functions computable by AC/sup 0/circuits with a …
The complexity of intersecting finite automata having few final states
The problem of determining whether several finite automata accept a word in common is
closely related to the well-studied membership problem in transformation monoids. We raise …
closely related to the well-studied membership problem in transformation monoids. We raise …