1559 search results - page 74 / 312 » Some Group Theory Problems |
135
click to vote
AEI
2008
15 years 6 months ago
2008
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
139
click to vote
SIGACT
2010
15 years 4 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
162
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The subject of this article is the long standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundam...
167
click to vote
CHES
1999
Springer
15 years 10 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
164
click to vote
TPHOL
2005
IEEE
15 years 11 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...