Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Absolute constant"”.

  1. The Effect of Self-Controlled Versus Fixed Post-KR Delay on Motor Performance and Learning

    … showed that participants decreased their absolute constant error and variable error compared to their pre-test. Participants had longer decision durations prior to requesting KR, while the opposite was found in the post-KR delay where participants had a longer duration after requesting KR. …

    brock Repository record for The Effect of Self-Controlled Versus Fixed Post-KR Delay on Motor Performance and Learning (opens in a new tab)

  2. Topics in high-dimensional geometry and optimal transport

    … to $\ell_2^n$. First, we show that there exist constants $\alpha,\epsilon>0$ such that for every positive integer $n$ there is a continuous odd function $\psi : S^m\to S^n$, with $m\geq \alpha n$, such that the $\epsilon$-expansion of the image of $\psi$ does not contain a great circle. We also …

    cambridge Repository record for Topics in high-dimensional geometry and optimal transport (opens in a new tab)

  3. Some problems in Graph Ramsey Theory

    … copies of graphs from F, where C is an absolute constant. This result is best possible, up to the constant C.

    mit Repository record for Some problems in Graph Ramsey Theory (opens in a new tab)

  4. On some problems in extremal, probabilistic and enumerative combinatorics

    … $F(k) \ge 2^{ck^2/ \log k}$, where $c >0$ is an absolute constant; here, we improve this bound significantly by showing that $F(k) \ge 2^{2^{k-1}/k}$ for all $k\in \N$. Fox--Grinshpun--Pach showed that every $3$-coloring of the complete graph on $n$ vertices without a rainbow triangle contains a …

    uiuc Repository record for On some problems in extremal, probabilistic and enumerative combinatorics (opens in a new tab)

  5. The complexity of joint computation

    … probability. Using this DPT, we show that for an absolute constant [alpha] > 0, the worst-case success probability of any [alpha]R₂(f)k-query randomized algorithm for f k falls exponentially with k. The best previous statement of this type, due to Klauck, Spalek, and de Wolf, required a query …

    mit Repository record for The complexity of joint computation (opens in a new tab)