top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow
The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow
Autore Fortnow Lance <1963->
Edizione [Course Book]
Pubbl/distr/stampa Princeton, : Princeton University Press, 2013
Descrizione fisica 1 online resource (189 p.)
Disciplina 511.3/52
Soggetto topico NP-complete problems
Computer algorithms
Soggetto non controllato Facebook
Frenemy
Hamiltonian paths
Internet
Ketan Mulmuley
Leonid Levin
Martin Hellman
NP problem
NP problems
NP-complete problems
NP-complete
P versus NP problem
P versus NP
Richard Feynman
Steve Cook
Twitter
Urbana algorithm
Whitfield Diffie
academic work
algebraic geometry
algorithm
algorithms
approximation
big data
computational problems
computer science
computers
computing
cryptography
cryptosystem
database
decryption
digital computers
efficient algorithms
efficient computation
encryption
factoring
fast computers
graph isomorphism
heuristics
linear programming
mathematics
max-cut
network security
networking
new technologies
parallel computation
perebor
prime numbers
problems
programming
public-key cryptography
quantum computers
quantum computing
quantum cryptography
quantum mechanics
quantum physical systems
research community
secret messages
social networking data
solution
teleportation
ISBN 1-4008-4661-7
1-299-15656-8
Classificazione COM051300MAT015000MAT017000MAT034000
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index
Record Nr. UNINA-9910779319903321
Fortnow Lance <1963->  
Princeton, : Princeton University Press, 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow
The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow
Autore Fortnow Lance <1963->
Edizione [Course Book]
Pubbl/distr/stampa Princeton, : Princeton University Press, 2013
Descrizione fisica 1 online resource (189 p.)
Disciplina 511.3/52
Soggetto topico NP-complete problems
Computer algorithms
Soggetto non controllato Facebook
Frenemy
Hamiltonian paths
Internet
Ketan Mulmuley
Leonid Levin
Martin Hellman
NP problem
NP problems
NP-complete problems
NP-complete
P versus NP problem
P versus NP
Richard Feynman
Steve Cook
Twitter
Urbana algorithm
Whitfield Diffie
academic work
algebraic geometry
algorithm
algorithms
approximation
big data
computational problems
computer science
computers
computing
cryptography
cryptosystem
database
decryption
digital computers
efficient algorithms
efficient computation
encryption
factoring
fast computers
graph isomorphism
heuristics
linear programming
mathematics
max-cut
network security
networking
new technologies
parallel computation
perebor
prime numbers
problems
programming
public-key cryptography
quantum computers
quantum computing
quantum cryptography
quantum mechanics
quantum physical systems
research community
secret messages
social networking data
solution
teleportation
ISBN 1-4008-4661-7
1-299-15656-8
Classificazione COM051300MAT015000MAT017000MAT034000
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index
Record Nr. UNINA-9910818849503321
Fortnow Lance <1963->  
Princeton, : Princeton University Press, 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski
Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski
Autore Ben-Tal A
Edizione [Course Book]
Pubbl/distr/stampa Princeton, NJ, : Princeton University Press, c2009
Descrizione fisica 1 online resource (565 p.)
Disciplina 519.6
Altri autori (Persone) El GhaouiLaurent
NemirovskiĭArkadiĭ Semenovich
Collana Princeton Series in Applied Mathematics
Soggetto topico Robust optimization
Linear programming
Soggetto non controllato 0O
Accuracy and precision
Additive model
Almost surely
Approximation algorithm
Approximation
Best, worst and average case
Bifurcation theory
Big O notation
Candidate solution
Central limit theorem
Chaos theory
Coefficient
Computational complexity theory
Constrained optimization
Convex hull
Convex optimization
Convex set
Cumulative distribution function
Curse of dimensionality
Decision problem
Decision rule
Degeneracy (mathematics)
Diagram (category theory)
Duality (optimization)
Dynamic programming
Exponential function
Feasible region
Floor and ceiling functions
For All Practical Purposes
Free product
Ideal solution
Identity matrix
Inequality (mathematics)
Infimum and supremum
Integer programming
Law of large numbers
Likelihood-ratio test
Linear dynamical system
Linear inequality
Linear map
Linear matrix inequality
Linear programming
Linear regression
Loss function
Margin classifier
Markov chain
Markov decision process
Mathematical optimization
Max-plus algebra
Maxima and minima
Multivariate normal distribution
NP-hardness
Norm (mathematics)
Normal distribution
Optimal control
Optimization problem
Orientability
P versus NP problem
Pairwise
Parameter
Parametric family
Probability distribution
Probability
Proportionality (mathematics)
Quantity
Random variable
Relative interior
Robust control
Robust decision-making
Robust optimization
Semi-infinite
Sensitivity analysis
Simple set
Singular value
Skew-symmetric matrix
Slack variable
Special case
Spherical model
Spline (mathematics)
State variable
Stochastic calculus
Stochastic control
Stochastic optimization
Stochastic programming
Stochastic
Strong duality
Support vector machine
Theorem
Time complexity
Uncertainty
Uniform distribution (discrete)
Unimodality
Upper and lower bounds
Variable (mathematics)
Virtual displacement
Weak duality
Wiener filter
With high probability
Without loss of generality
ISBN 1-282-25928-8
9786612259289
1-4008-3105-9
Classificazione SK 870
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Frontmatter -- Contents -- Preface -- Part I. Robust Linear Optimization -- Chapter One. Uncertain Linear Optimization Problems and their Robust Counterparts -- Chapter Two. Robust Counterpart Approximations of Scalar Chance Constraints -- Chapter Three. Globalized Robust Counterparts of Uncertain LO Problems -- Chapter Four. More on Safe Tractable Approximations of Scalar Chance Constraints -- Part II. Robust Conic Optimization -- Chapter Five. Uncertain Conic Optimization: The Concepts -- Chapter Six. Uncertain Conic Quadratic Problems with Tractable RCs -- Chapter Seven. Approximating RCs of Uncertain Conic Quadratic Problems -- Chapter Eight. Uncertain Semidefinite Problems with Tractable RCs -- Chapter Nine. Approximating RCs of Uncertain Semidefinite Problems -- Chapter Ten. Approximating Chance Constrained CQIs and LMIs -- Chapter Eleven. Globalized Robust Counterparts of Uncertain Conic Problems -- Chapter Twelve. Robust Classi¯cation and Estimation -- Part III. Robust Multi-Stage Optimization -- Chapter Thirteen. Robust Markov Decision Processes -- Chapter Fourteen. Robust Adjustable Multistage Optimization -- Part IV. Selected Applications -- Chapter Fifteen. Selected Applications -- Appendix A: Notation and Prerequisites -- Appendix B: Some Auxiliary Proofs -- Appendix C: Solutions to Selected Exercises -- Bibliography -- Index
Record Nr. UNINA-9910778219003321
Ben-Tal A  
Princeton, NJ, : Princeton University Press, c2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui