29908 search results - page 608 / 5982 » On the Complexity of |
166
Voted
DEBS
2007
ACM
15 years 11 months ago
2007
ACM
140
Voted
DEBS
2007
ACM
15 years 11 months ago
2007
ACM
209
Voted
ANTS
2010
Springer
15 years 11 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
178
Voted
SAT
2010
Springer
15 years 11 months ago
2010
Springer
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...