2430 search results - page 151 / 486 » Computing Tutte Polynomials |
131
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
117
click to vote
LICS
2008
IEEE
15 years 11 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
131
click to vote
ICDAR
2007
IEEE
15 years 11 months ago
2007
IEEE
We model on-line ink traces for a set of 219 symbols to “best fit” low-degree polynomial series. Using a collection of mathematical writing samples, we find that in many cas...
141
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
155
click to vote
COLT
2001
Springer
15 years 9 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...