371 search results - page 3 / 75 » Partition Theorems and Computability Theory |
JCT
2002
13 years 6 months ago
2002
We present a result which is obtained by combining a result of Carlson with the Finitary Dual Ramsey Theorem of Graham-Rothschild. We start by introducing some notation. We confor...
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
FSTTCS
1994
Springer
13 years 11 months ago
1994
Springer
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
IJCAI
2003
13 years 8 months ago
2003
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
JCT
2007
13 years 7 months ago
2007
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...