Pages that link to "Item:Q843612"
From MaRDI portal
The following pages link to In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612):
Displaying 4 items.
- Space-time isomorphism problem is intractable (NP-hard) (Q807992) (← links)
- Is the World Itself Fuzzy? Physical Arguments and Unexpected Computational Consequences of Zadeh’s Vision (Q2971592) (← links)
- INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM (Q5408361) (← links)
- Wormholes, superfast computations, and Selivanov's theorem (Q6561174) (← links)