1071 search results - page 94 / 215 » The Calculus of Algebraic Constructions |
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
130
click to vote
AAECC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
158
click to vote
ICST
2008
IEEE
16 years 18 days ago
2008
IEEE
This paper presents a method of component testing based on algebraic specifications. An algorithm for generating checkable test cases is proposed. A prototype testing tool called ...
135
click to vote
APN
2001
Springer
15 years 10 months ago
2001
Springer
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
152
click to vote
TIT
2008
15 years 6 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...