Sign in
|
English
|
Terms of Use
Dictionary
Forum
Contacts
G
o
o
g
l
e
|
Forvo
|
+
the problem of graph isomorphism can be solved efficiency
This HTML5 player is not supported by your browser
stresses
Makarov.
проблема полиморфизма графов может быть решена эффективно
(i.e. in polynomial-time; т.е. в полиномиальном времени)
Add
|
Report an error
|
Get short URL
|
Language Selection Tips
