A Measure of Space for Computing over the Reals
Abstract
We propose a new complexity measure of space for the BSS model of computation. We define LOGSPACE\W and PSPACE\W complexity classes over the reals. We prove that LOGSPACE\W is included in NC2\R and in P\W, i.e. is small enough for being relevant. We prove that the Real Circuit Decision Problem is P\R-complete under LOGSPACE\W reductions, i.e. that LOGSPACE\W is large enough for containing natural algorithms. We also prove that PSPACE\W is included in PAR\R.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.