Suchergebnisse - "Nondeterministic parallel complexity classes"

On nondeterminism in parallel computation

Autoren: P W Dymond

Quelle: Theoretical Computer Science. 47:111-120

Schlagwörter: Nondeterministic parallel complexity classes, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Formal languages and automata, hardware modification machine, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4041260
https://doi.org/10.1016/0304-3975(86)90139-8
https://www.sciencedirect.com/science/article/pii/0304397586901398
https://www.sciencedirect.com/science/article/abs/pii/0304397586901398
https://dblp.uni-trier.de/db/journals/tcs/tcs47.html#Dymond86
https://core.ac.uk/display/82452035
https://doi.org/10.1016/0304-3975(86)90139-8