Skip to main navigation Skip to search Skip to main content

Computational Requirements for Nano-Machines: There is Limited Space at the Bottom

Florian Lau, Florian Büther, Bennet Gerlach

Abstract

Akyildiz et al. envisioned the use of nanonetworks as a new paradigm for computation on a very small scale. Since then, many scientists researched dependent aspects like nanoscale communication. However, most research omitted specifying the computational complexity required for their respective scenarios. To close this gap, we analyzed numerous medical scenarios and extracted the formal problems to be solved. We then compared the resulting formal problems using computational complexity theory and displayed them sorted into the classes AC 0, NC 1 and L. Lastly, we describe the benefits of our results for simulation purposes and to better assess the feasibility of nanonetwork scenarios.
Original languageEnglish
Title of host publication4th ACM International Conference on Nanoscale Computing and Communication 2017 (ACM NanoCom'17)
Number of pages6
Place of PublicationWashington DC, USA
PublisherACM
Publication date27.09.2017
Pages11:1-11:6
ISBN (Print)978-1-4503-4931-4
DOIs
Publication statusPublished - 27.09.2017
EventNanoCom '17 Proceedings of the 4th ACM International Conference on Nanoscale Computing and Communication - Washington, United States
Duration: 27.09.201729.09.2017

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 3 - Good Health and Well-being
    SDG 3 Good Health and Well-being
  2. SDG 9 - Industry, Innovation, and Infrastructure
    SDG 9 Industry, Innovation, and Infrastructure
  3. SDG 11 - Sustainable Cities and Communities
    SDG 11 Sustainable Cities and Communities
  4. SDG 12 - Responsible Consumption and Production
    SDG 12 Responsible Consumption and Production

Fingerprint

Dive into the research topics of 'Computational Requirements for Nano-Machines: There is Limited Space at the Bottom'. Together they form a unique fingerprint.

Cite this