Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Caleb Robelle"'
A version of time-bounded Kolmogorov complexity, denoted KT, has received attention in the past several years, due to its close connection to circuit complexity and to the Minimum Circuit Size Problem MCSP. Essentially all results about the complexit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::811370386e56ef5b730787d6b31caafb
Autor:
Michael Dinitz, Caleb Robelle
Publikováno v:
PODC
It was recently shown that a version of the greedy algorithm gives a construction of fault-tolerant spanners that is size-optimal, at least for vertex faults. However, the algorithm to construct this spanner is not polynomial-time, and the best-known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dee9856b3fdfb4b012530e8bb1d373ba
https://doi.org/10.1145/3382734.3405735
https://doi.org/10.1145/3382734.3405735
