2430 search results - page 73 / 486 » Computing Tutte Polynomials |
126
Voted
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
121
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
113
click to vote
TLCA
2007
Springer
15 years 8 months ago
2007
Springer
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
105
click to vote
ISSAC
2005
Springer
15 years 8 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
106
click to vote
APPT
2009
Springer
15 years 6 months ago
2009
Springer
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...