Sciweavers

922 search results - page 151 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
FSTTCS
1991
Springer
15 years 5 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
CADE
2005
Springer
15 years 3 months ago
The CoRe Calculus
We present the CoRe calculus for contextual reasoning which supports reasoning directly at the assertion level, where proof steps are justified in terms of applications of defini...
Serge Autexier
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
15 years 3 months ago
The Multiplicative Quantum Adversary
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
Robert Spalek
COCOON
2008
Springer
15 years 3 months ago
Polychromatic Colorings of n-Dimensional Guillotine-Partitions
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
Balázs Keszegh
COLING
2008
15 years 3 months ago
A Classification of Dialogue Actions in Tutorial Dialogue
In this paper we present a taxonomy of dialogue moves which describe the actions that students and tutors perform in tutorial dialogue. We are motivated by the need for a categori...
Mark Buckley, Magdalena Wolska