1034 search results - page 38 / 207 » Small Pi01 Classes |
DCC
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based o...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
SEKE
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we present an alternative to the VISITOR pattern, DYNAMIC DISPATCHER, that can be applied to extend existing software in a nonintrusive way, and which simulates cova...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
EJC
2000
14 years 10 months ago
2000
For general polytopes, it has turned out that with respect to many questions it su ces to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is c...