A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
d Abstract) Marcelo Fiore∗ and Sam Staton† Computer Laboratory, University of Cambridge We introduce a mathematical structural operational semantics that yields a congruence r...
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Guided by the cooperation theory, this paper puts forward an interactive and cooperative learning environment design that is based on the self-learning mode and cooperative learnin...
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...