Timeline for Is it possible to find closest number to a given irrational one, which is obtained by dividing 2 numbers in a given range faster than O(n^2)?
Current License: CC BY-SA 4.0
|when toggle format||what||by||license||comment|
|yesterday||comment||added||Neal Young||Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center, cstheory.stackexchange.com/help/on-topic. Your question might be suitable for Computer Science which has a broader scope, cs.stackexchange.com.|
|S Jan 13 at 0:03||review||First questions|
|Jan 13 at 9:12|
|S Jan 13 at 0:03||history||asked||Omegon||CC BY-SA 4.0|