scientific article; zbMATH DE number 866044

MaRDI QIDQ4873209zbMATH OpenFDO

Authors Dara Morgenstein, Vladik Kreinovich

Publication date 5 September 1996

zbMATH Keywords

feasible algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Parallel computational geometry
• Fractal Parallelism: Solving SAT in Bounded Space and Time
• scientific article; zbMATH DE number 1182929
• Publication:3028358

Cited in

(7)

• A universal cellular automaton in the hyperbolic plane.
• Is the World Itself Fuzzy? Physical Arguments and Unexpected Computational Consequences of Zadeh’s Vision
• scientific article; zbMATH DE number 903281 (Why is no real title available?)
• Wormholes, superfast computations, and Selivanov's theorem
• Space-time isomorphism problem is intractable (NP-hard)
• 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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4873209)