7106 search results - page 369 / 1422 » Restricted Complexity, General Complexity |
165
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
131
click to vote
PQCRYPTO
2010
15 years 9 months ago
2010
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
138
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract--In communication systems where full-duplex transmission is required, digital echo cancellers are employed to cancel echo by means of adaptive filtering. In order to reduc...
144
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Computer programs able to play different kinds of games (aka bots) is a growing area of interest for the computer game industry as the demand for better skilled computerized oppon...
151
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...