7796 search results - page 116 / 1560 » On Generalized Schur Numbers |
130
click to vote
AIML
2006
15 years 6 months ago
2006
We survey a number of decidablity and undecidablity results concerning epistemic temporal logic. The goal is to provide a general picture which will facilitate the `sharing of idea...
136
click to vote
DCG
2006
15 years 4 months ago
2006
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...
120
Voted
DM
2006
15 years 4 months ago
2006
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
116
click to vote
EJC
2006
15 years 4 months ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
134
Voted
TCS
2011
14 years 11 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...