The time complexity of RAC sort in mathematical programming: a real-valued array well-ordering method of worst-case time complexity \(O(n)\)

Uložené v:
Podrobná bibliografia
Názov: The time complexity of RAC sort in mathematical programming: a real-valued array well-ordering method of worst-case time complexity \(O(n)\)
Autori: Nakagawa, Yuji
Informácie o vydavateľovi: Research Institute for Mathematical Sciences, Kyoto University, Kyoto
Predmety: Abstract computational complexity for mathematical programming problems
Druh dokumentu: Article
Popis súboru: application/xml
Prístupová URL adresa: https://zbmath.org/1398014
Prístupové číslo: edsair.c2b0b933574d..ef3def2f04bb743edb41b64bd5ae14f3
Databáza: OpenAIRE