Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

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

descriptionPublicationkeyboard_double_arrow_right Article Publisher:Research Institute for Mathematical Sciences, Kyoto University, Kyoto
Authors: Nakagawa, Yuji;

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

No summary information available
Keywords

Abstract computational complexity for mathematical programming problems

Powered by OpenAIRE graph
Found an issue? Give us feedback