The main result extends the optimal nondeterministic advice bound for P-selective sets to every binary membership-comparable language, and a deterministic polynomial-time algorithm for promise Unique-Circuit-SAT gives 2-mc subseteq P/O(n).
Abstract
Selectors and comparators supply only partial information about membership: a selector names a member of any pair that meets the language, while a binary membership comparator merely excludes one of the four membership vectors of a pair. We ask how much nonuniform advice turns such information into exact recognition. Our main result extends the optimal nondeterministic advice bound for P-selective sets to every binary membership-comparable language: $2-mc \subseteq NP /(3n+5)\cap\mathrm{coNP}/(3n+5)$, with common fixed advice and certificates of at most $5n+12$ bits. The class is strictly larger; some 2-mc sets are not truth-table reducible to any P-selective set. The proof replaces the tournament king by an independent two-step cover of true signed literals, together with a short-forcing-or-exact-majority dichotomy, and it relativizes. Via an advice-preserving isolation transfer, a deterministic polynomial-time algorithm for promise Unique-Circuit-SAT gives $2-mc \subseteq P/O(n)$. For selectors we determine tight orders of ordinary advice: $\Theta(n)$ for errorless average-case computation and $\Theta(n^2)$ for worst-case bounded-error computation, the latter independent of the interpreter's coin bound. One oracle realizes both orders on a single language and separates ordinary from coin-dependent advice. The quadratic and linear lower bounds hold for tournament-query procedures and relativized languages, not unconditionally for unrelativized P-selective sets.
This expanded version of this paper develops the full weak-advantage regime, where saving $2^{-O((log n)^d)}$ gives randomized SAT exponent $d$ and PH exponent $d^k$ at fixed level $k$; the quasipolynomial and exponential hierarchy consequences; binary-comparator advice bounds; and the certificate-length boundary betwe...
This formulation separates sampling the input distribution from querying the model and evaluating its output; distinguishes real audit data from generated data; distinguishes real audit data from generated data (chosen-randomness, or gray-box, access to the sampler); and allows the prover and verifier to use different...
G. Couteau, Nikolas Melissaris, Tamara Paris· 0 citations
It is demonstrated how to compute the largest value of $\alpha$ for which a committee still fails the axiom using this mincut formulation, and a direct mincut formulation of the problem on a bipartite graph is given.
This work builds the flow-sensitive type system family that the quantale calls for, and shows that the object which makes such families useful, the universal type object from which every member specialises, splits in two, with a consequence for enforcement.
The leximin++ proof of Plaut and Roughgarden for agents with identical monotone valuations gives a natural EFX-repair procedure: starting from an arbitrary partition, repeatedly transfer an eligible item to a minimum-valued bundle. The procedure terminates, but the standard argument gives no polynomial bound on the num...
Hannaneh Akrami, Arash Ashuri, B. Chaudhury et al.· 0 citations
Let $h(n) = n + \tau(n)$, where $\tau$ counts divisors. Erd\H{o}s and Graham asked, after Spiro, whether the orbits of any two positive integers under $h$ eventually share a point (Problem 414 on Bloom's list). The problem is open, and a finite computation cannot close it; nothing about it has been checked by a proof k...
Ibrahim Mian, Shayaan Siddique· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.