1450 search results - page 88 / 290 » On the Complexity of Hardness Amplification |
FOCS
2002
IEEE
14 years 2 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...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
3DPVT
2006
IEEE
14 years 25 days ago
2006
IEEE
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that...
ISIM
2007
13 years 10 months ago
2007
Software architecture, and its behavior can be expressed as UML models. Models of complex systems can be also complex and hard to read – they may consists of hundreds of artifact...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...