725 search results - page 81 / 145 » Bounding Degrees on RPL |
85
Voted
JC
2008
15 years 20 days ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
84
Voted
CPC
2007
15 years 20 days ago
2007
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
115
Voted
MCSS
2006
Springer
15 years 20 days ago
2006
Springer
We consider robust adaptive control designs for relative degree one, minimum phase linear systems of known high frequency gain. The designs are based on the dead-zone and projecti...
107
click to vote
CPC
2002
15 years 15 days ago
2002
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
80
Voted
JSC
2000
15 years 15 days ago
2000
We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and a bound o...