Ramirez, Anthony, University of Tennessee, Knoxville
-
Vol 16 (2024) - Articles
Time complexity of the analyst's traveling salesman algorithm
Abstract 2. [PDF]
Journal of Logic and Analysis ISSN: 1759-9008
Font Size
Keywords
Computable presentations
Continua
Continuous logic
Effective completeness
Existentially closed models
K-theory
Metric structures
approximation algorithms, polynomial-time approximation scheme, traveling salesperson problem, analyst traveling salesman problem
continuous logic
definable sets
effective infinitesimals
expansions of the real ordered additive group, fractals, monadic second order theory of one successor
model theory, von Neumann algebra, free entropy, random matrix, strongly 1-bounded, ultraproduct
nonstandard analysis
proof mining
pseudo-arc
recursive inequalities
semilattices
solenoid
subgradient methods
topometric spaces