In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...