Sciweavers

DLT
2009
13 years 2 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela
FSTTCS
1992
Springer
13 years 8 months ago
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
Vikraman Arvind, Johannes Köbler, Martin Mund...