Evidence of Exponential Speed-Up in the Solution of Hard Optimization Problems
Optimization problems pervade essentially every scientific discipline and industry. A common form requires identifying a solution satisfying the maximum number among a set of many conflicting constraints. Often, these problems are particularly difficult to solve, requiring resources that grow expone...
Saved in:
Main Authors: | Fabio L. Traversa, Pietro Cicotti, Forrest Sheldon, Massimiliano Di Ventra |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2018-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2018/7982851 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Applying Data Clustering Feature to Speed Up Ant Colony Optimization
by: Chao-Yang Pang, et al.
Published: (2014-01-01) -
A Comparative Study on Solving Optimization Problems With Exponentially Fewer Qubits
by: David Winderl, et al.
Published: (2024-01-01) -
Existence and Asymptotic Behavior of Boundary Blow-Up Solutions for Weighted p(x)-Laplacian Equations with Exponential Nonlinearities
by: Li Yin, et al.
Published: (2010-01-01) -
Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times
by: Gholamhasan Shirdel, et al.
Published: (2020-09-01) -
Speeding Up FPGA Placement via Partitioning and Multithreading
by: Cristinel Ababei
Published: (2009-01-01)