Hertling, Peter and Selivanov, Victor. "Complexity issues for Preorders on finite labeled forests".
Logic, Computation, Hierarchies, edited by Vasco Brattka, Hannes Diener and Dieter Spreen, Berlin, Boston: De Gruyter, 2014, pp. 165-190.
https://doi.org/10.1515/9781614518044.165Hertling, P. & Selivanov, V. (2014). Complexity issues for Preorders on finite labeled forests. In V. Brattka, H. Diener & D. Spreen (Ed.),
Logic, Computation, Hierarchies (pp. 165-190). Berlin, Boston: De Gruyter.
https://doi.org/10.1515/9781614518044.165Hertling, P. and Selivanov, V. 2014. Complexity issues for Preorders on finite labeled forests. In: Brattka, V., Diener, H. and Spreen, D. ed.
Logic, Computation, Hierarchies. Berlin, Boston: De Gruyter, pp. 165-190.
https://doi.org/10.1515/9781614518044.165Hertling, Peter and Selivanov, Victor. "Complexity issues for Preorders on finite labeled forests" In
Logic, Computation, Hierarchies edited by Vasco Brattka, Hannes Diener and Dieter Spreen, 165-190. Berlin, Boston: De Gruyter, 2014.
https://doi.org/10.1515/9781614518044.165Hertling P, Selivanov V. Complexity issues for Preorders on finite labeled forests. In: Brattka V, Diener H, Spreen D (ed.)
Logic, Computation, Hierarchies. Berlin, Boston: De Gruyter; 2014. p.165-190.
https://doi.org/10.1515/9781614518044.165Copied to clipboard
