251 search results - page 21 / 51 » On Modular Decomposition of Integers |
100
click to vote
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
SIAMDM
2008
14 years 8 months ago
2008
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...
EWSA
2006
Springer
15 years 1 months ago
2006
Springer
An architectural aspect is a concern that cuts across architecture ty units and cannot be effectively modularized using the given abstractions of conventional Architecture Descript...
83
Voted
IWSOC
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes a very high radix scalable Montgomery multiplier. It extends the radix-2 Tenca-Koç scalable architecture using w × v – bit integer multipliers in place of...
FFA
2010
14 years 7 months ago
2010
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...