11 citations · 37 across the 12 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
cs.CC2008★ 8 cited
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
Martin Ziegler
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f:A->B, additional structural information about the input x in A (that…
cs.CG2008★ 6 cited
Planar Visibility Counting
Matthias Fischer, Matthias Hilbig, Claudius Jähn +2
For a fixed virtual scene (=collection of simplices) S and given observer position p, how many elements of S are weakly visible (i.e. not fully occluded by others) from p? The pres…
cs.CC2008★ 1 cited
Kolmogorov Complexity Theory over the Reals
Martin Ziegler, Wouter M. Koolen
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing ma…