- Full text PDF available (4)
Dejaň Zivkovi´c In this paper we analyze a variant of the n-disk Towers of Hanoi problem with an arbitrary starting and ending configuration using transition graphs representing valid configurations. In particular, we show that starting with any configuration, there is a sequence of moves that goes through each valid configuration exactly once and back to… (More)
In this paper we consider the problem of improving Web performance and propose an efficient differencing and merging system (DMS) based on an HTTP protocol extension. To provide for faster information exchange over the Web, the system tries to transfer only computed differences between requested documents and previously retrieved documents from the same… (More)
Valiant  showed that the clique function is structurally different than the majority function by establishing the following "switching lemma ~ : Any function f whose set of prime implicants is a large enough subset of the set of cliques (and thus requiring big ~2-circuits), has a large set of prime clauses (i.e., big II2-circuits). As a corollary, an… (More)
We show that the complexity classes AC0 and NC' consist exactly of, respectively, constant and O(log n) width polynomial-size Boolean formulas.