2430 search results - page 80 / 486 » Computing Tutte Polynomials |
115
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
110
Voted
GC
2004
Springer
15 years 8 months ago
2004
Springer
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
136
Voted
COMGEO
2006
ACM
15 years 2 months ago
2006
ACM
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
100
click to vote
AISC
2004
Springer
15 years 8 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
136
Voted
RTA
2010
Springer
15 years 6 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...