2766 search results - page 98 / 554 » Algorithms for trigonometric polynomials |
113
Voted
COCO
2001
Springer
15 years 5 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
108
click to vote
CORR
2010
Springer
15 years 28 days ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
104
Voted
ISAAC
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
77
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
76
Voted
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...