Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
23
click to vote
JC
1998
favorite
Email
discuss
report
58
views
more
JC 1998
»
Some Lower Bounds for the Complexity of Continuation Methods
13 years 10 months ago
Download
www6.cityu.edu.hk
Jean-Pierre Dedieu, Steve Smale
Real-time Traffic
JC 1998
|
claim paper
Related Content
»
Lower bounds in communication complexity based on factorization norms
»
Some Notes on the Linear Complexity of SidelnikovLempelCohnEastman Sequences
»
New lower bounds for some spherical designs
»
Some Lower Bounds on Geometric Separability Problems
»
A MultiRound Communication Lower Bound for Gap Hamming and Some Consequences
»
New Lower Bounds for Some Multicolored Ramsey Numbers
»
Quantum lower bound for the collision problem
»
Improved Lower Bounds for TreeLike Resolution over Linear Inequalities
»
Lower Bounds for Approximation of Some Classes of Lebesgue Measurable Functions by Sigmoid...
more »
Post Info
More Details (n/a)
Added
22 Dec 2010
Updated
22 Dec 2010
Type
Journal
Year
1998
Where
JC
Authors
Jean-Pierre Dedieu, Steve Smale
Comments
(0)
Researcher Info
JC 1998 Study Group
Computer Vision