197 search results - page 6 / 40 » New Upper Bounds for Ramsey Numbers |
189
click to vote
JAL
2000
15 years 6 months ago
2000
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....
149
click to vote
ISSAC
2007
Springer
16 years 24 days ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
159
click to vote
IWCMC
2006
ACM
16 years 19 days ago
2006
ACM
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and...
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and ...
170
click to vote
TIT
2002
15 years 6 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...