Author:
Balcázar JoséL.,Hermo Montserrat
Subject
General Computer Science,Theoretical Computer Science
Reference28 articles.
1. Lower bounds for the low hierarchy;Allender;J. Assoc. Comput. Mach.,1992
2. Relating equivalence and reducibility to sparse sets;Allender;SIAM J. Comput.,1992
3. Kolmogorov complexity and degrees of tally sets;Allender;Inform. Comput.,1990
4. Reductions to sets of low information content;Arvind,1993
5. Upper bounds on the complexity of sparse and tally descriptions;Arvind;Math. Systems Theory,1996
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Machines that perform measurements;Theoretical Computer Science;2022-07
2. THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY;The Review of Symbolic Logic;2014-09-09
3. Incomputability at the foundations of physics (A study in the philosophy of science);Journal of Logic and Computation;2013-09-20
4. Axiomatizing physical experiments as oracles to algorithms;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2012-07-28
5. Limits to measurement in experiments governed by algorithms;Mathematical Structures in Computer Science;2010-11-08