The following pages link to Mika Hirvensalo (Q418772):
Displaying 47 items.
- (Q197715) (redirect page) (← links)
- On probabilistic and quantum reaction systems (Q418773) (← links)
- Book review of: Phillip Kaye, Raymond Laflamme, Michele Mosca, An introduction to quantum computing (Q458449) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- Computing partial information out of intractable: powers of algebraic numbers as an example (Q1048926) (← links)
- Quantum computing. (Q1428354) (← links)
- Binary (generalized) Post Correspondence Problem (Q1605309) (← links)
- Quantum computing -- facts and folklore (Q1610717) (← links)
- Computing with quanta -- impacts of quantum theory on computation. (Q1853471) (← links)
- A Riemann hypothesis analog for the Krawtchouk and discrete Chebyshev polynomials (Q2146182) (← links)
- On injectivity of quantum finite automata (Q2229947) (← links)
- Computational limitations of affine automata (Q2326807) (← links)
- On the generating function of discrete Chebyshev polynomials (Q2406880) (← links)
- Positivity of second order linear recurrent sequences (Q2489940) (← links)
- Improved matrix pair undecidability results (Q2641877) (← links)
- GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS (Q2709980) (← links)
- (Q2743688) (← links)
- (Q2893302) (← links)
- Mortality for 2 ×2 Matrices Is NP-Hard (Q2912716) (← links)
- Quantum Information – A Tutorial (Q3007698) (← links)
- UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES (Q3065609) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- (Q3395950) (← links)
- (Q3396618) (← links)
- Various Aspects of Finite Quantum Automata (Q3532997) (← links)
- On the Joint Spectral Radius for Bounded Matrix Languages (Q3584963) (← links)
- (Q4223780) (← links)
- (Q4251052) (← links)
- Lower Bounds for Las Vegas Automata by Information Theory (Q4462677) (← links)
- The Identity Problem for Matrix Semigroups in SL<sub>2</sub>(ℤ) is <b>NP</b>-complete (Q4575748) (← links)
- (Q4668741) (← links)
- (Q4668742) (← links)
- (Q4708580) (← links)
- (Q4790417) (← links)
- Decision Problems for Probabilistic Finite Automata on Bounded Languages (Q4914308) (← links)
- (Q4934339) (← links)
- Acceptance Ambiguity for Quantum Automata (Q5092433) (← links)
- (Q5232904) (← links)
- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages (Q5448781) (← links)
- On the Computational Power of Affine Automata (Q5739014) (← links)
- Theory Is Forever (Q5894869) (← links)
- Quantum computing (Q5915347) (← links)
- Marked PCP is decidable (Q5941069) (← links)
- Interference as a computational resource: a tutorial (Q6084215) (← links)
- Computational limitations of affine automata and generalized affine automata (Q6095491) (← links)
- Correction to: ``Computational limitations of affine automata and generalized affine automata'' (Q6095492) (← links)
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete (Q6178465) (← links)
