Infinitely-often autoreducible sets

10.1137/S0097539704441630

Saved in:

Bibliographic Details
Main Authors:	Beigel, R., Fortnow, L., Stephan, F.
Other Authors:	MATHEMATICS
Format:	Article
Published:	2014
Subjects:	Algorithmic randomness Autoreducible sets Computational complexity Exponential-time computable sets Hausdorff-dimension Infinitely-often autoreducible sets
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/103424
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

Be the first to leave a comment!

Similar Items