The Non - Recursive Power


We present two new complexity classes which are based on a complexity class C and an error probability function F. The rst, F-Err C, reeects the (weak) feasibility of problems that can be computed within the error bound F. As a more adequate measure to investigate lower bounds we introduce F-Errio C where the error is innnitely often bounded by the function… (More)


Cite this paper

@inproceedings{Schindelhauer1999TheN, title={The Non - Recursive Power}, author={Christian Schindelhauer and Andreas Jakoby}, year={1999} }