Browsing eNauka
Browsing by Author Barnaby Martin
Showing results 1 to 2 of 2
| Issue Date | Title | Author(s) | Type | Мp-cat. |
|---|---|---|---|---|
| 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 |