1004 search results - page 82 / 201 » Product representations of polynomials |
CIE
2010
Springer
15 years 2 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
DLOG
2004
14 years 11 months ago
2004
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
ICFHR
2010
14 years 4 months ago
2010
Representing digital ink traces as points in a function space has proven useful for online recognition. Ink trace coordinates or their integral invariants are written as parametri...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...