543 search results - page 55 / 109 » New Upper Bounds for MaxSat |
151
click to vote
COCO
2007
Springer
16 years 9 days ago
2007
Springer
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....
151
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
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 ...
146
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
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...
163
click to vote
GLVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
207
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....