450 search results - page 34 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
ASIACRYPT
2003
Springer
14 years 23 days ago
2003
Springer
We present an algorithm that finds polynomials with many roots modulo many primes by rotating candidate Number Field Sieve polynomials using the Chinese Remainder Theorem. We also...
CPM
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
TCS
2010
13 years 6 months ago
2010
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and And...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper, network-based cooperative control of nonlinear dynamical systems is investigated. A theorem on cooperative stability is presented for designing nonlinear consensus a...