2430 search results - page 282 / 486 » Computing Tutte Polynomials |
131
Voted
JSCIC
2010
14 years 10 months ago
2010
While second order methods for computational simulations of fluid flow provide the basis of widely used commercial software, there is a need for higher order methods for more accur...
150
click to vote
TCS
2010
14 years 10 months ago
2010
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
137
click to vote
ECCC
2011
14 years 7 months ago
2011
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
139
click to vote
SIGGRAPH
1991
ACM
15 years 7 months ago
1991
ACM
Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies...
144
click to vote
COMGEO
2010
ACM
15 years 3 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...