10289 search results - page 225 / 2058 » Standard bases in K |
192
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We describe an enhanced version of the TWINKLE factoring device and analyse to what extent it can be expected to speed up the sieving step of the Quadratic Sieve and Number Field S...
216
click to vote
ODP
1993
15 years 7 months ago
1993
The user-centred philosophy of Computer Supported Cooperative Work (CSCW) challenges the established principles of many existing technologies. In turn, the development of CSCW is ...
178
click to vote
APAL
2006
15 years 6 months ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
202
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
166
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...