eNauka - pregled
Pregled prema Autor Barnaby Martin
Prikaz rezultata 1 do 2 od 2
| Godina | Naslov | Autor(i) | Tip rezultata | Mp-kat. |
|---|---|---|---|---|
| 2016 | Almost all strongly connected semicomplete digraphs have - only trivial idempotent polymorphisms | Đapić, Petar   ; Marković, Petar ; Barnaby Martin | Conference Paper | Mp. category will be shown later |
| 2016 | On the complexity of Quantified Constraint Satisfaction Problem via polymorphisms | Đapić, Petar ; Marković, Petar ; Barnaby Martin | Conference Paper | Mp. category will be shown later |