Items where Subject is "46 INFORMATION AND COMPUTING SCIENCES > 4613 Theory of computation > 461302 Computational complexity and computability"

Fields of Research (57579)
- 46 INFORMATION AND COMPUTING SCIENCES (715)
  - 4613 Theory of computation (25)
    - 461302 Computational complexity and computability (7)

Group by: Creators | Item Type

Number of items at this level: 7.

Article

Henderson, Alec, Nicolescu, Radu, Dinneen, Michael J., Chan, T.N., Happe, Hendrik, and Hinze, Thomas (2023) Programmable and parallel water computing. Journal of Membrane Computing, 5. pp. 25-54.

Dinneen, Michael J., Henderson, Alec, and Nicolescu, Radu (2023) Sublinear P system solutions to NP-complete problems. Theoretical Computer Science, 958. 113848.

Henderson, Alec, Nicolescu, Radu, Dinneen, Michael J., Chan, T.N., Happe, Hendrik, and Hinze, Thomas (2021) Turing completeness of water computing. Journal of Membrane Computing, 3 (3). pp. 182-193.

Liu, Yezhou, Nicolescu, Radu, Sun, Jing, and Henderson, Alec (2021) A sublinear Sudoku solution in cP Systems and its formal verification. Computer Science Journal of Moldova, 29 (1 (85)). pp. 3-28.

Henderson, Alec, Nicolescu, Radu, and Dinneen, Michael J. (2020) Solving a PSPACE-complete problem with cP systems. Journal of Membrane Computing, 2 (4). pp. 311-322.

Morse, Jeremy, Kerrison, Steven, and Eder, Kerstin (2018) On the limitations of analyzing worst-case dynamic energy of processing. ACM Transactions on Embedded Computing Systems, 17 (3). 59.

Conference Item

Henderson, Alec, and Nicolescu, Radu (2019) Actor-Like cP Systems. In: Lecture Notes in Computer Science (11399) pp. 160-187. From: CMC 2018: 19th International Conference on Membrane Computing, 4-7 September 2018, Dresden, Germany.

This list was generated on Sun Dec 22 22:44:27 2024 AEST.