The time complexity of RAC sort in mathematical programming: a real-valued array well-ordering method of worst-case time complexity \(O(n)\)
Gespeichert in:
| Titel: | The time complexity of RAC sort in mathematical programming: a real-valued array well-ordering method of worst-case time complexity \(O(n)\) |
|---|---|
| Autoren: | Nakagawa, Yuji |
| Verlagsinformationen: | Research Institute for Mathematical Sciences, Kyoto University, Kyoto |
| Schlagwörter: | Abstract computational complexity for mathematical programming problems |
| Publikationsart: | Article |
| Dateibeschreibung: | application/xml |
| Zugangs-URL: | https://zbmath.org/1398014 |
| Dokumentencode: | edsair.c2b0b933574d..ef3def2f04bb743edb41b64bd5ae14f3 |
| Datenbank: | OpenAIRE |
Nájsť tento článok vo Web of Science Schreiben Sie den ersten Kommentar!