3454 search results - page 140 / 691 » Modern computer algebra |
152
click to vote
FOSSACS
2010
Springer
16 years 27 days ago
2010
Springer
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building in...
180
click to vote
ISSAC
1997
Springer
15 years 10 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
149
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
180
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
185
click to vote
CSB
2005
IEEE
16 years 23 hour ago
2005
IEEE
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...