1302 search results - page 66 / 261 » On the Strong Chromatic Number |
159
click to vote
ENTCS
2008
15 years 6 months ago
2008
The broad availability of multi-core chips on standard desktop PCs provides strong motivation for the development of new algorithms for logic model checkers that can take advantag...
122
click to vote
JCT
2007
15 years 6 months ago
2007
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
153
click to vote
JSYML
2011
15 years 1 months ago
2011
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
137
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we introduce a new method of performing direct solution of the harmonic balance Jacobian. For examples with moderate number of harmonics and moderate to strong nonli...
161
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...