57 search results - page 3 / 12 » Invisible Genericity and 0 |
JSC
2000
13 years 7 months ago
2000
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
WDAG
1999
Springer
13 years 11 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
SAGA
2009
Springer
14 years 1 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
ICRA
2000
IEEE
13 years 11 months ago
2000
IEEE
This talk will review the progress and the evolution of the development of range sensing techniques at the NRC laboratories. Essentially a 3 0 imaging project at the beginning, it...
SIAMCOMP
1998
13 years 7 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...