Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time.

László Babai Robert Beals Daniel N. Rockmore

Published in: ISSAC (1993)

Keyphrases

computational complexity
approximation algorithms
turing machine
special case
singular value decomposition
black box
randomized algorithm
matrix representation
decomposable negation normal form
neural network
case study
worst case
deterministic domains
deterministic automata