activity
20072025
most citedOn a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees

5 citations · 15 across the 15 of their papers we have counts for

collaborators
Showing cs.ETShow all

1 paper · 1 filter

cs.ET2017★ 2 cited

Computability and Complexity of Unconventional Computing Devices

Hajo Broersma, Susan Stepney, Goran Wendin

We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete proble…