Evidence of Exponential Speed-Up in the Solution of Hard Optimization Problems

, , &
Complexity 2018:1-13 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1155/2018/7982851

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Answer Sets and Qualitative Optimization.Gerhard Brewka - 2006 - Logic Journal of the IGPL 14 (3):413-433.
Does Optimization Imply Rationality?Philippe Mongin - 2000 - Synthese 124 (1-2):73-111.
Does optimization imply rationality?Philippe Mongin - 2000 - Synthese 124 (1-2):73 - 111.
Optimal gain tuning of PI speed controller in induction motor drives using particle swarm optimization.Radha Thangaraj, Thanga Chelliah, Millie Pant, Ajith Abraham & China Grosan - 2011 - Logic Journal of the IGPL 19 (2):343-356.
Genetic Optimization Methods for Traffic Engineering Problems in Multi-Service High Speed Optical Networks.V. Pasias, D. A. Karras, R. C. Papademetriou & B. Prasad - 2007 - Journal of Intelligent Systems 16 (4):339-358.
Solving stochastic programming problems using modified differential evolution algorithms.Radha Thangaraj, Millie Pant, Pascal Bouvry & Ajith Abraham - 2012 - Logic Journal of the IGPL 20 (4):732-746.
Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons.Dietmar Schuchardt & Hans-Dietrich Hecker - 1995 - Mathematical Logic Quarterly 41 (2):261-267.
Hard-core extensionalism and the analysis of belief.Don Brownstein - 1982 - Noûs 16 (4):543-566.
How experimental algorithmics can benefit from Mayo’s extensions to Neyman–Pearson theory of testing.Thomas Bartz-Beielstein - 2008 - Synthese 163 (3):385 - 396.
A Criteria Transformation Approach to Pattern Matching based on Non-Linear Parameter Optimization.Reinhard Möller, Bernard Beitz, Thomas Lepich, Dietmar Tutsch & Christian John - 2015 - Journal of Intelligent Systems 24 (2):249-263.
Fast quantum algorithms for handling probabilistic and interval uncertainty.Vladik Kreinovich & Luc Longpré - 2004 - Mathematical Logic Quarterly 50 (4-5):405-416.
How experimental algorithmics can benefit from Mayo’s extensions to Neyman–Pearson theory of testing.Thomas Bartz-Beielstein - 2008 - Synthese 163 (3):385-396.
A note on the decidability of exponential terms.Paola D'Aquino & Giuseppina Terzo - 2007 - Mathematical Logic Quarterly 53 (3):306-310.
Real Closed Exponential Subfields of Pseudo-Exponential Fields.Ahuva C. Shkop - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):591-601.
On mathematical instrumentalism.Patrick Caldon & Aleksandar Ignjatović - 2005 - Journal of Symbolic Logic 70 (3):778-794.

Analytics

Added to PP
2018-07-05

Downloads
13 (#1,032,575)

6 months
6 (#510,793)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references