Results 1  10
of
720,363
New Upper Bounds for Satisfiability in . . .
, 1997
"... Traditional results in modal logics state that, if a formula ' is satisfiable in K (Ksatisfiable), then it has a Kripke model M s.t. jjM jj 2 j'j , jjM jj being the number of states of M and j'j the number of subformulas of '. A further result states a bound of jjM jj j&a ..."
Abstract
 Add to MetaCart
'j d , d being the modal depth of '. In more recent papers, a decision procedure has been proposed which branches on the truth values of the distinct "atoms"  i.e., subformulas which cannot be decomposed propositionally. Following this approach, we propose here two new bounds based
New upper bounds for the energy of graphs
, 2004
"... Let G be a finite simple undirected graph with n vertices and m edges. For v ∈ V, the 2degree of v is the sum of the degrees of the vertices adjacent to v. The energy of G, denoted by E(G), is defined as the sum of the absolute values of the eigenvalues of G. In this paper, we present two new upper ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
upper bounds for E(G) in terms of n, m, the degrees and 2degrees of vertices, and characterize the graphs for which the bounds are best possible.
New Upper Bounds on Error Exponents
"... We derive new upper bounds on the error exponents for the maximum likelihood decoding and error detecting in the binary symmetric channels. This is an improvement on the straightline bound by ShannonGallagerBerlekamp (1967) and the McElieceOmura (1977) minimum distance bound. For the probability ..."
Abstract

Cited by 27 (6 self)
 Add to MetaCart
We derive new upper bounds on the error exponents for the maximum likelihood decoding and error detecting in the binary symmetric channels. This is an improvement on the straightline bound by ShannonGallagerBerlekamp (1967) and the McElieceOmura (1977) minimum distance bound
New upper bounds for MaxSat
 Charles University, Praha, Faculty of Mathematics and Physics
, 1998
"... We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove that MaxSat can be solved in time O(F  · 1.3972 K), where F  is the length of a formula F in conjunctive normal form and K is the number of clauses in F. We also prove the time b ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove that MaxSat can be solved in time O(F  · 1.3972 K), where F  is the length of a formula F in conjunctive normal form and K is the number of clauses in F. We also prove the time
A new upper bound for diagonal Ramsey numbers
 Annals of Mathematics
"... We prove a new upper bound for diagonal twocolour Ramsey numbers, showing that there exists a constant C such that log k ..."
Abstract

Cited by 49 (14 self)
 Add to MetaCart
We prove a new upper bound for diagonal twocolour Ramsey numbers, showing that there exists a constant C such that log k
New Upper Bounds for Maximum Satisfiability
 Journal of Algorithms
, 1999
"... The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses. This paper describes exact algorithms that provide new upper bounds for MaxSat. We prove that MaxSat can be solved i ..."
Abstract

Cited by 38 (2 self)
 Add to MetaCart
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses. This paper describes exact algorithms that provide new upper bounds for MaxSat. We prove that MaxSat can be solved
New Upper Bounds for maximumentropy sampling
 MODA 6 – ADVANCES IN MODELORIENTED DESIGN AND ANALYSIS
, 2000
"... We develop and experiment with new upper bounds for the constrained maximumentropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use of Fischer's inequality with previously developed bounds. We demonstrate this in detail ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We develop and experiment with new upper bounds for the constrained maximumentropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use of Fischer's inequality with previously developed bounds. We demonstrate
New upper bounds on sphere packings
, 2001
"... Abstract. We develop an analogue for sphere packing of the linear programming bounds for errorcorrecting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to s ..."
Abstract

Cited by 67 (7 self)
 Add to MetaCart
Abstract. We develop an analogue for sphere packing of the linear programming bounds for errorcorrecting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used
New upper bounds for pairing heaps
 In Scandinavian Workshop on Algorithm Theory (LNCS 1851
, 2000
"... Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing heaps have the same amortized runtimes as Fibonacci heaps for all operations but Decreasekey. 1 ..."
Abstract

Cited by 25 (9 self)
 Add to MetaCart
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing heaps have the same amortized runtimes as Fibonacci heaps for all operations but Decreasekey. 1
Two new upper bounds for SAT
, 1998
"... In 1980 B. Monien and E. Speckenmeyer proved that satisfiability of a propositional formula consisting of K clauses can be checked in time of the order 2^{K/3}. Recently O. Kullmann and H. Luckhardt proved the bound 2^{L/9}, where L is the length of the input formula. The algorithms leading to these ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
propagation rule etc. In this paper we present a new transformation rule and two algorithms using this rule. These algorithms have the bounds 2^{0.30897K} and 2^{0.10537L}, respectively.
Results 1  10
of
720,363