2430 search results - page 87 / 486 » Computing Tutte Polynomials |
124
Voted
IANDC
2006
15 years 2 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
114
Voted
DM
2007
15 years 2 months ago
2007
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
109
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
106
Voted
EUROPAR
2001
Springer
15 years 7 months ago
2001
Springer
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...
111
Voted
FCS
2006
15 years 4 months ago
2006
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...