"If Space-Time Is Discrete, It Could Be Possible to Solve NP-Complete ..."

Ricardo Alvarez et al. (2020)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-06-23

- view
  - electronic edition @ oldcitypublishing.com
- export record
  dblp key:
  - journals/ijuc/AlvarezSSCK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijuc/AlvarezSSCK20
Ricardo Alvarez, Nick Sims, Christian Servin, Martine Ceberio, Vladik Kreinovich:
If Space-Time Is Discrete, It Could Be Possible to Solve NP-Complete Problems in Polynomial Time. Int. J. Unconv. Comput. 15(3): 193-218 (2020)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.