324 reputation
413
bio website turkistany.blogspot.com
location Makkah, Saudi Arabia
age 44
visits member for 4 years, 4 months
seen 2 hours ago

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"


1d
revised Recognizing sequences sortable by transpositions?
added 250 characters in body
1d
revised Recognizing sequences sortable by transpositions?
added 250 characters in body
1d
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
Jul
14
comment How hard is a variant of graph automorphism problem?
@EmilJeĊ™ábek I seek non-trivial automorphism. Fixed the statement of the question.
Jul
14
revised How hard is a variant of graph automorphism problem?
added 11 characters in body
Jul
14
comment How hard is a variant of graph automorphism problem?
$GA$ problem: Input : a graph $G(V, E)$, Question: Is there non-trivial automorphism of $G$ ( other that the identity )?
Jul
14
asked How hard is a variant of graph automorphism problem?
Jul
9
accepted Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs
Jul
7
comment Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs
Emil, thanks for your answer. Although FP sampling function is an intuitive interpretation, I am interested in efficient sampling in the sense of Nisan's answer.
Jul
5
revised Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs
added 1 character in body
Jul
5
asked Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs