2435 search results - page 135 / 487 » Intellexer Question Answering |
115
Voted
JCT
2000
15 years 3 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...
135
Voted
SIAMCOMP
2000
15 years 3 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...
124
Voted
ORDER
2007
15 years 3 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....
135
click to vote
JCT
2010
15 years 2 months ago
2010
For every k and r, we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with k colors, there exists a point covered by prec...
114
Voted
JGT
2010
15 years 2 months ago
2010
We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether...