Search results

  • ...es to solve a problem as a function of input, usually expressed with big-O notation) and [[space]] (how much memory it takes to solve a problem). In such analy ...ath>\text{TIME}(f(n))</math> is the set of languages decidable by an <math>O(f(n))</math>-time deterministic Turing machine.
    6 KB (1,104 words) - 14:11, 25 October 2017
  • ...by his problems; we're trying to record great unsolved problems. There are big problems in mathematics that are important but where it is very hard to iso ...n polynomial time (as a function of the input, often expressed using big-O notation) can also be ''solved'' in polynomial time. The set <math>P</math> consists
    13 KB (1,969 words) - 16:57, 22 February 2024
  • ...show that <math>\pi(x) - </math> <math>\int^n_2 \frac{1}{log x} =\mathcal{O}(x^{\frac{1}{2}+\epsilon})</math>. This second statement is equivalent to t
    1 KB (238 words) - 12:45, 13 August 2015
  • <i><b>Notation</b></i> ...AC (b^2(x - z) + y(a^2 - c^2) =0) \implies</math> its BC coordinates <math>O = (a^2S_A : b^2S_B : c^2S_C).</math>
    34 KB (6,882 words) - 13:42, 12 December 2024
  • Let the tangent circle be <math>\omega</math>. Some notation first: let <math>BC=a</math>, <math>AB=b</math>, <math>s</math> be the semi pair O = intersectionpoint(A--C,circle(I,r));
    25 KB (4,686 words) - 23:55, 15 January 2025