AAECC 1999 | Sciweavers

31

AAECC
1999
Springer

82views Algorithms» more AAECC 1999»

Reasoning over Networks by Symbolic Methods

13 years 11 months ago

Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...

Thomas Sturm

claim paper

Read More »

39

click to vote

AAECC
1999
Springer

112views Algorithms» more AAECC 1999»

MRC - Data Structures and Procedures for Computing in Monoid and Group Rings

13 years 11 months ago

Download www.ricam.oeaw.ac.at

Gr

Birgit Reinert, Dirk Zeckzer

claim paper

Read More »

21

click to vote

AAECC
1999
Springer

78views Algorithms» more AAECC 1999»

Properties of Finite Response Input Sequences of Recursive Convolutional Codes

13 years 11 months ago

Download www.cnam.fr

Abstract. A recursive convolutional encoder can be regarded as an innite impulse response system over the Galois Field of order 2. First, in this paper, we introduce nite response ...

Didier Le Ruyet, Hong Sun, Han Vu Thien

claim paper

Read More »

24

click to vote

AAECC
1999
Springer

90views Algorithms» more AAECC 1999»

Monomial Ideals and Planar Graphs

14 years 3 months ago

Download www.mast.queensu.ca

Ezra Miller, Bernd Sturmfels

claim paper