Sciweavers

11565 search results - page 45 / 2313
» Computing Minimal Mappings
Sort
View
JSC
1998
47views more  JSC 1998»
13 years 10 months ago
Strategies for Computing Minimal Free Resolutions
Roberto La Scala, Michael Stillman
DAC
2005
ACM
14 years 11 months ago
Effective bounding techniques for solving unate and binate covering problems
Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically impact both size and perf...
Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
ISSAC
2001
Springer
129views Mathematics» more  ISSAC 2001»
14 years 3 months ago
Computation of the degree of rational maps between curves
The degree of a rational map measures how often the map covers the image variety. In particular, when the rational map is a parametrization, the degree measures how often the para...
J. Rafael Sendra, Franz Winkler