Search results
- Implicit computational complexity (ICC) is a subfield of computational complexity theory that characterizes algorithms by constraints on the way in which...9 KB (1,348 words) - 08:52, 18 December 2023
- In probability theory, Yan's theorem is a separation[disambiguation needed] and existence result. It is of particular interest in financial mathematics...3 KB (393 words) - 07:36, 5 March 2024
- In stochastic calculus, the Boué–Dupuis formula is variational representation for Wiener functionals. The representation has application in finding large...3 KB (313 words) - 05:23, 13 August 2023
- The union theorem is a result from the 60s in computational complexity theory. It was published in 1969 by Ed McCreight and Albert Meyer. Originally it...2 KB (290 words) - 15:50, 30 December 2023