The following pages link to Bruno Loff (Q343855):
Displaying 24 items.
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- A foundation for real recursive function theory (Q1032628) (← links)
- Catalytic space: non-determinism and hierarchy (Q1702851) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Learning Reductions to Sparse Sets (Q2849914) (← links)
- Reductions to the set of random strings: The resource-bounded case (Q2878751) (← links)
- Monotonicity Constraints in Characterizations of PSPACE (Q2882555) (← links)
- On the Complexity of Measurement in Classical Physics (Q3502630) (← links)
- Oracles and Advice as Measurements (Q3543332) (← links)
- Computational complexity with experiments as oracles. II. Upper bounds (Q3561915) (← links)
- (Q4600389) (← links)
- (Q4601876) (← links)
- Lower Bounds for Elimination via Weak Regularity (Q4636619) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- (Q5092472) (← links)
- Simulation beats richness: new data-structure lower bounds (Q5230358) (← links)
- Computing with a full memory (Q5259622) (← links)
- The New Promise of Analog Computation (Q5425320) (← links)
- Computational complexity with experiments as oracles (Q5505107) (← links)
- The computational power of parsing expression grammars (Q5915559) (← links)
- Hardness of constant-round communication complexity (Q6115394) (← links)
- (Q6126258) (← links)