35 citations · 200 across the 47 of their papers we have counts for
Showing 2005 · cs.CCShow all
2 papers · 2 filters
cs.CC2005
An Exact 2.9416^n Algorithm for the Three Domatic Number Problem
Tobias Riege, Jörg Rothe
The three domatic number problem asks whether a given undirected graph can be partitioned into at least three dominating sets, i.e., sets whose closed neighborhood equals the verte…
cs.CC2005★ 4 cited
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory
Lane A. Hemaspaandra, Joerg Rothe, Amitabh Saxena
Rabi and Sherman [RS97,RS93] proved that the hardness of factoring is a sufficient condition for there to exist one-way functions (i.e., p-time computable, honest, p-time noninvert…