Sciweavers

13603 search results - page 27 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
DAM
2008
102views more  DAM 2008»
13 years 8 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
ENTCS
2008
91views more  ENTCS 2008»
13 years 8 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra