Sciweavers

434 search results - page 42 / 87
» Monadic Bounded Algebras
Sort
View
DCC
2008
IEEE
14 years 9 months ago
On solving sparse algebraic equations over finite fields
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...
Igor Semaev
ISSAC
2009
Springer
269views Mathematics» more  ISSAC 2009»
14 years 4 months ago
On factorization of multivariate polynomials over algebraic number and function fields
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...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
CDC
2008
IEEE
113views Control Systems» more  CDC 2008»
14 years 4 months ago
Model reduction for a class of input-quantized systems in the max-plus algebra
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 ...
Whitney Weyerman, Sean Warnick
ICC
2007
IEEE
112views Communications» more  ICC 2007»
14 years 4 months ago
Algebraic Constructions of Space-Frequency Codes
— 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 ...
Mao-Ching Chiu, Hsiao-feng Lu
WG
2005
Springer
14 years 3 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
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...
Ross M. McConnell, Fabien de Montgolfier