2440 search results - page 163 / 488 » Data-Intensive Question Answering |
COMBINATORICS
2002
13 years 10 months ago
2002
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
DM
2002
13 years 10 months ago
2002
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...
JCT
2000
13 years 10 months ago
2000
We answer a question posed by Lampert and Slater [7]. Consider a sequence of real numbers qn in the interval [0, 1] defined by q0 = 0, q1 = 1, and, for n 1, qn+1 equals an averag...
SIAMCOMP
2000
13 years 10 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
ORDER
2007
13 years 9 months ago
2007
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....