2446 search results - page 25 / 490 » Choiceless Polynomial Time |
STOC
2010
ACM
14 years 4 months ago
2010
ACM
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require n(1) time per operation, unless 3SUM has strongly subquadratic alg...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
A new class of nonparametric algorithms for high-dimensional binary classification is proposed using cascades of low dimensional polynomial structures. Construction of polynomial ...
ALT
2002
Springer
14 years 4 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...