2430 search results - page 131 / 486 » Computing Tutte Polynomials |
140
click to vote
FOCS
1992
IEEE
15 years 8 months ago
1992
IEEE
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...
149
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
171
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— We present a new type of oriented bounding surfaces, which is particularly well suited for shortest distance computations. The bounding surfaces are obtained by considering sur...
138
click to vote
GD
2009
Springer
15 years 9 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...