3 citations · 4 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2011★ 1 cited
Computational Complexity on Signed Numbers
Stefan Jaeger
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of…
cs.CC2008★ 3 cited
Solving the P/NP Problem under Intrinsic Uncertainty
Stefan Jaeger
Heisenberg's uncertainty principle states that it is not possible to compute both the position and momentum of an electron with absolute certainty. However, this computational limi…