Sciweavers

26 search results - page 3 / 6
» ipl 2000
Sort
View
IPL
2000
96views more  IPL 2000»
13 years 9 months ago
On bounded occurrence constraint satisfaction
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...
Johan Håstad
IPL
2000
77views more  IPL 2000»
13 years 9 months ago
Simplified proof of the Fourier Sampling Theorem
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...
Peter Høyer
IPL
2000
94views more  IPL 2000»
13 years 9 months ago
On rewrite constraints and context unification
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...
Joachim Niehren, Sophie Tison, Ralf Treinen
IPL
2000
119views more  IPL 2000»
13 years 9 months ago
Cyclic-cubes and wrap-around butterflies
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...
Meghanad D. Wagh, Prakash Math, Osman Guzide
IPL
2000
105views more  IPL 2000»
13 years 9 months ago
Coverings that preserve sense of direction
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...
Paolo Boldi, Sebastiano Vigna