664 search results - page 29 / 133 » Some results for a class of generalized polynomials |
APAL
2007
14 years 9 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
71
Voted
CSL
2010
Springer
14 years 9 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
96
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
80
Voted
ALT
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
ALT
2005
Springer
15 years 6 months ago
2005
Springer
In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced...