22 search results - page 2 / 5 » Factorization formulas for MacDonald polynomials |
CASC
2005
Springer
13 years 10 months ago
2005
Springer
The behavior of the Cayley-Dixon resultant construction and the structure of Dixon matrices are analyzed for composed polynomial systems constructed from a multivariate system in w...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
JSC
2006
13 years 4 months ago
2006
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
DAC
2001
ACM
14 years 5 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...