18. ZTE B860H: Getting Armbian into It (pen.waltuh.cyou)

This blog will cover the Armbian installation guide for B860H V1 / V2. Caution: This model MUST not be confused with V5, as both revision have an entirely different h...

24. Randomized query complexity can beat certificate complexity (arxiv.org)

A long-standing open question in query complexity asks whether there is a total Boolean function f with R(f) << C(f), where R(f) and C(f) denote its bounded-error randomized query complexity and certificate complexity, respectively. We construct a function with R(f) = O~(sqrt{C(f)}), which is optimal up to log factors. The same function also has $Q(f) = O~(C(f)^{1/4}), where Q(f) is the bounded-error quantum query complexity of f, which is also nearly optimal.

Article Details

Browse by Date

Type to search HN and engineering blog articles
Press Escape to close  |  ↑↓ to navigate  |  Enter to open