Sciweavers

537 search results - page 54 / 108
» A new upper bound for 3-SAT
Sort
View
MOBIHOC
2007
ACM
15 years 9 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
ISMVL
2007
IEEE
94views Hardware» more  ISMVL 2007»
15 years 4 months ago
Representations of Elementary Functions Using Edge-Valued MDDs
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...
Shinobu Nagayama, Tsutomu Sasao
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
15 years 4 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
COCO
2004
Springer
156views Algorithms» more  COCO 2004»
15 years 3 months ago
Multiparty Quantum Coin Flipping
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...
FOCS
2003
IEEE
15 years 3 months ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev