scientific article

zbMath1340.68041MaRDI QIDQ3192466

M. I. Zakharevich, O. M. Kosheleva, Vladik Ya. Kreinovich

Publication date: 12 October 2015

Full work available at URL: http://msm.univer.omsk.su/jrn31/tr14-55a.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-complete problemfeasible algorithmno-perfect-theory principleusing physical observations in computations

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Is the World Itself Fuzzy? Physical Arguments and Unexpected Computational Consequences of Zadeh’s Vision ⋮ Unnamed Item ⋮ Towards the Possibility of Objective Interval Uncertainty

This page was built for publication: