We revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC `02). We prove that if NP has a balanced function f such that any circuit of si...
The behavior of nondeterminate systems can be hard to predict, since similar inputs at different times can generate different outputs. In other words, the behavior seen during tes...
Tim Menzies, Bojan Cukic, Harshinder Singh, John D...
Performance non-determinism in computer systems complicates evaluation, use, and even development of these systems. In performance evaluation via benchmarking and simulation, nond...
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
A new token-passing algorithm called AR-TP for avoiding the non-determinism of some networking technologies is presented. This protocol allows the schedulability analysis of the n...