2430 search results - page 239 / 486 » Computing Tutte Polynomials |
108
click to vote
APAL
2007
15 years 4 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
140
click to vote
DAM
2008
15 years 4 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
136
click to vote
FOCM
2008
15 years 4 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
131
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
130
click to vote
TCS
2008
15 years 4 months ago
2008
These are notes for a lecture given at Ohio University on June 3, 2006. An important topic in commutative algebra is the Rees algebra of an ideal in a commutative ring. The Rees al...