Pages that link to "Item:Q1275000"
From MaRDI portal
The following pages link to The structure of logarithmic advice complexity classes (Q1275000):
Displaying 9 items.
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Machines that perform measurements (Q2672643) (← links)
- Axiomatizing physical experiments as oracles to algorithms (Q2941593) (← links)
- Limits to measurement in experiments governed by algorithms (Q3061157) (← links)
- On the Complexity of Measurement in Classical Physics (Q3502630) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Degrees and reducibilities of easy tally sets (Q5096899) (← links)
- THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY (Q5176163) (← links)
- Computational complexity with experiments as oracles (Q5505107) (← links)
