Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CC
2005
Springer

favoriteEmaildiscussreport

103views System Software» more CC 2005»

Valiant's model and the cost of computing integers

13 years 4 months ago

Valiant's model and the cost of computing integers

Download perso.ens-lyon.fr

Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if there exists a polynomial

Pascal Koiran

Real-time Traffic

Arithmetic Operations | CC 2005 | Minimum Number | Sequence Xn | System Software |

claim paper

Related Content

» Minimal Cost ReachabilityCoverability in Priced Timed Petri Nets

» Incorporating inventory and routing costs in strategic location models

» Cost Optimization Model for Business Applications in Virtualized Grid Environments

» An Efficient Criterion for Mode Decision in H264AVC

» Global optimization of multiscenario mixed integer nonlinear programming models arising in...

» Noninteractive Proofs for Integer Multiplication

» Modeling Dynamic Load Balancing in Molecular Dynamics to Achieve Scalable Parallel Executi...

» MIP models for connected facility location A theoretical and computational study

» An Integer Linear Programming Approach to Database Design

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	CC
Authors	Pascal Koiran

Comments (0)