434 search results - page 42 / 87 » Monadic Bounded Algebras |
137
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
127
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
104
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the flow shop with ...
122
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Recently an algebraic construction of (nt × Q) space-frequency (SF) codes over finite field Fq was proposed for use in MIMO-OFDM systems, where nt is the number of transmit ...
141
Voted
WG
2005
Springer
15 years 9 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...