2446 search results - page 210 / 490 » Choiceless Polynomial Time |
EUROCRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The problem we study in this paper is the key recovery problem on the C schemes and generalizations where the quadratic monomial of C (the product of two linear monomials...
ADCM
2008
13 years 8 months ago
2008
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
DAM
2007
13 years 8 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
FSE
2011
Springer
12 years 11 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...