251 search results - page 1 / 51 » Graph Isomorphism is in SPP |
FOCS
2002
IEEE
13 years 9 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...
STACS
1992
Springer
13 years 8 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
SIAMDM
2010
12 years 11 months ago
2010
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...