We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes ...
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehag...
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
`Desire Lines' are the ultimate unbiased expression of natural human purpose and refer to tracks worn across grassy spaces, where people naturally walk
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...