3128 search results - page 111 / 626 » Finite element method |
124
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
135
Voted
IJCAI
1989
15 years 4 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
144
click to vote
ACISP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...
123
click to vote
JCT
2010
15 years 1 months ago
2010
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ...
133
Voted
JCT
2010
14 years 10 months ago
2010
Let Sm be the set of symmetric bilinear forms on an m-dimensional vector space over GF(q), where q is a power of two. A subset Y of Sm is called an (m, d)-set if the difference of...