The time complexity of RAC sort in mathematical programming: a real-valued array well-ordering method of worst-case time complexity \(O(n)\)
Saved in:
| Title: | The time complexity of RAC sort in mathematical programming: a real-valued array well-ordering method of worst-case time complexity \(O(n)\) |
|---|---|
| Authors: | Nakagawa, Yuji |
| Publisher Information: | Research Institute for Mathematical Sciences, Kyoto University, Kyoto |
| Subject Terms: | Abstract computational complexity for mathematical programming problems |
| Document Type: | Article |
| File Description: | application/xml |
| Access URL: | https://zbmath.org/1398014 |
| Accession Number: | edsair.c2b0b933574d..ef3def2f04bb743edb41b64bd5ae14f3 |
| Database: | OpenAIRE |
Nájsť tento článok vo Web of Science Be the first to leave a comment!