369 reputation
415
bio website turkistany.blogspot.com
location Makkah, Saudi Arabia
age 44
visits member for 4 years, 5 months
seen Jan 28 at 11:37

Wild Florida Gator living in Arabia

Mohammad Al-Turkistany, Ph.D. in Computer Engineering, University of Florida

Assistant Professor of Computer Engineering, Umm Al-Qura University, Makkah, Saudi Arabia

"The reasonable man adapts himself to the world; the unreasonable persists in trying to adapt the world to himself. Therefore all progress depends on the unreasonable".

George Bernard Shaw

"You can't turn mince back into meat by rotating the mincer's handle in the opposite direction"


Jan
10
awarded  Popular Question
Jan
6
awarded  Quorum
Jan
3
comment Evidence that Graph Isomorphism problem is not $NP$-complete
@GerryMyerson I think stating that GI is "longest standing" is not accurate. I have edited the post accordingly.
Jan
3
revised Evidence that Graph Isomorphism problem is not $NP$-complete
added 8 characters in body
Jan
3
revised Evidence that Graph Isomorphism problem is not $NP$-complete
added 198 characters in body
Jan
3
revised Evidence that Graph Isomorphism problem is not $NP$-complete
added 33 characters in body
Jan
3
revised Evidence that Graph Isomorphism problem is not $NP$-complete
deleted 4 characters in body
Jan
3
asked Evidence that Graph Isomorphism problem is not $NP$-complete
Dec
26
revised Recognizing sequences sortable by transpositions?
added 250 characters in body
Dec
26
revised Recognizing sequences sortable by transpositions?
added 250 characters in body
Dec
26
asked Recognizing sequences sortable by transpositions?
Oct
31
accepted How hard is a variant of graph automorphism problem?
Oct
27
awarded  Good Question
Oct
27
revised How hard is reconstructing a permutation from its differences sequence?
Fixed broken link
Oct
26
accepted How hard is reconstructing a permutation from its differences sequence?
Oct
22
comment Recognizing bridgeless cubic graph with special 2-factor
No, I am not aware of such result.
Oct
22
asked Recognizing bridgeless cubic graph with special 2-factor
Jul
16
comment How hard is a variant of graph automorphism problem?
@Kimball No, GA is not known to be GI-hard. I'm not looking for heuristics.
Jul
16
revised How hard is a variant of graph automorphism problem?
added 21 characters in body
Jul
16
revised How hard is a variant of graph automorphism problem?
added 412 characters in body