 | 2012 |
|---|
| 10 |       | Eric Allender,
Harry Buhrman,
Luke Friedman,
Bruno Loff:
Reductions to the set of random strings: the resource-bounded case.
Electronic Colloquium on Computational Complexity (ECCC) 19: 54 (2012) |
| 9 | | Amir M. Ben-Amram,
Bruno Loff,
Isabel Oitavem:
Monotonicity Constraints in Characterizations of PSPACE.
J. Log. Comput. 22(2): 179-195 (2012) |
| 2010 |
|---|
| 8 | | Harry Buhrman,
Lance Fortnow,
Michal Koucký,
Bruno Loff:
Derandomizing from Random Strings.
IEEE Conference on Computational Complexity 2010: 58-63 |
| 2009 |
|---|
| 7 | | José Félix Costa,
Bruno Loff,
Jerzy Mycka:
A foundation for real recursive function theory.
Ann. Pure Appl. Logic 160(3): 255-288 (2009) |
| 6 | | Harry Buhrman,
Lance Fortnow,
Michal Koucký,
Bruno Loff:
Derandomizing from Random Strings
CoRR abs/0912.3162: (2009) |
| 5 | | Bruno Loff,
José Félix Costa:
Five Views of Hypercomputation.
IJUC 5(3-4): 193-207 (2009) |
| 2008 |
|---|
| 4 | | Edwin J. Beggs,
José Félix Costa,
Bruno Loff,
John Tucker:
On the Complexity of Measurement in Classical Physics.
TAMC 2008: 20-30 |
| 3 | | Edwin J. Beggs,
José Félix Costa,
Bruno Loff,
John V. Tucker:
Oracles and Advice as Measurements.
UC 2008: 33-50 |
| 2007 |
|---|
| 2 | | José Félix Costa,
Bruno Loff,
Jerzy Mycka:
The New Promise of Analog Computation.
CiE 2007: 189-195 |
| 1 | | Bruno Loff,
José Félix Costa,
Jerzy Mycka:
Computability on reals, infinite limits and differential equations.
Applied Mathematics and Computation 191(2): 353-371 (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page