110 search results - page 7 / 22 » New Upper Bounds for Maximum Satisfiability |
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
TON
2010
13 years 1 months ago
2010
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
TOCL
2008
13 years 7 months ago
2008
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
IPMI
2003
Springer
14 years 8 months ago
2003
Springer
Abstract. We present a Bayesian multimodality non-rigid image registration method. Since the likelihood is unknown in the general multimodality setting, we use a density estimator ...