2430 search results - page 111 / 486 » Computing Tutte Polynomials |
160
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
128
click to vote
ALT
2003
Springer
16 years 2 months ago
2003
Springer
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
128
click to vote
LICS
2008
IEEE
15 years 11 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
160
click to vote
STOC
2000
ACM
15 years 9 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
186
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...