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

Uloženo v:
Podrobná bibliografie
Název: The time complexity of RAC sort in mathematical programming: a real-valued array well-ordering method of worst-case time complexity \(O(n)\)
Autoři: Nakagawa, Yuji
Informace o vydavateli: Research Institute for Mathematical Sciences, Kyoto University, Kyoto
Témata: Abstract computational complexity for mathematical programming problems
Druh dokumentu: Article
Popis souboru: application/xml
Přístupová URL adresa: https://zbmath.org/1398014
Přístupové číslo: edsair.c2b0b933574d..ef3def2f04bb743edb41b64bd5ae14f3
Databáze: OpenAIRE