An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
Recently a new family of Cayley graphs of fixed even node degree called the Cyclic-cubes were proposed as interconnection networks by Fu and Chau (1998). We show that these networ...
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...