2430 search results - page 28 / 486 » Computing Tutte Polynomials |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
WSC
2008
13 years 10 months ago
2008
The use of simulation as a modeling and analysis tool is wide spread. Simulation is an enabling tool for experimenting virtually on a validated computer environment. Often the und...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...