Login / Signup
Mohamed Saeed-Taha
Publication Activity (10 Years)
Years Active: 2019-2019
Publications (10 Years): 2
Top Topics
Np Complete
Graph Isomorphism
Graph Search
Top Venues
ISIT
CoRR
</>
Publications
</>
Magali Bardet
,
Ayoub Otmani
,
Mohamed Saeed-Taha
Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial.
CoRR
(2019)
Magali Bardet
,
Ayoub Otmani
,
Mohamed Saeed-Taha
Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial.
ISIT
(2019)