The Computational Complexity of the Traveling Salesman Problem

Name: The Computational Complexity of the Traveling Salesman Problem
Author: Craig Alan Feinstein

Craig Alan Feinstein

Paper2006-11-17English

computational financearxiv

Description

In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.

Quantitative mode stability for the wave equation on the Kerr-Newman spacetime

Risk-Aware Objective-Based Forecasting in Inertia Management

Chainalysis: Geography of Cryptocurrency 2023

Periodicity in Cryptocurrency Volatility and Liquidity

Impact of Geometric Uncertainty on the Computation of Abdominal Aortic Aneurysm Wall Strain

Simulation-based Bayesian inference with ameliorative learned summary statistics -- Part I