54 search results - page 3 / 11 » The Expressive Power of Voting Polynomials |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
CASC
2005
Springer
14 years 1 months ago
2005
Springer
The behavior of the Cayley-Dixon resultant construction and the structure of Dixon matrices are analyzed for composed polynomial systems constructed from a multivariate system in w...
ACSD
2003
IEEE
14 years 28 days ago
2003
IEEE
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent an...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...