99 search results - page 2 / 20 » Uniform Characterizations of Complexity Classes of Functions |
FOCS
1993
IEEE
13 years 10 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...
JLP
2010
13 years 4 months ago
2010
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
ENTCS
2008
13 years 5 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
STOC
1994
ACM
13 years 10 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
CSL
2007
Springer
13 years 12 months ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....