3 citations · 3 across the 5 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2005
On the Solution of Graph Isomorphism by Dynamical Algorithms
Marats Golovkins
In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of a…
cs.CC2002★ 3 cited
Probabilistic Reversible Automata and Quantum Automata
Marats Golovkins, Maksim Kravtsev
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic autom…