On the Relations Between Discrete and Continuous Complexity Theory
From MaRDI portal
Publication:4835531
DOI10.1002/malq.19950410214zbMath0827.68042MaRDI QIDQ4835531
Publication date: 17 December 1995
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19950410214
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
68W10: Parallel algorithms in computer science
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items