61 search results - page 13 / 13 » Is There an Oblivious RAM Lower Bound |
AML
2011
13 years 1 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...