Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2022
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic ComputationPages 129–138https://doi.org/10.1145/3476446.3536172We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their algorithm appears ...
- articleJune 2005
Decidable and Undecidable Problems about Quantum Automata
SIAM Journal on Computing (SICOMP), Volume 34, Issue 6Pages 1464–1473https://doi.org/10.1137/S0097539703425861We study the following decision problem: is the language recognized by a quantum finite automaton empty or nonempty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or nonstrict thresholds. ...