scientific article; zbMATH DE number 866044

zbMath0844.68060MaRDI QIDQ4873209

Dara Morgenstein, Vladik Ya. Kreinovich

Publication date: 5 September 1996

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

zbMATH Keywords

feasible algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

In some curved spaces, one can solve NP-hard problems in polynomial time ⋮ Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity ⋮ A universal cellular automaton in the hyperbolic plane. ⋮ Is the World Itself Fuzzy? Physical Arguments and Unexpected Computational Consequences of Zadeh’s Vision

This page was built for publication: