Searching for authors named "Mika Hirvensalo" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
Computing partial information out of uncomputable one - The first digit of . . .
- … as an example Mika Hirvensalo Juhani Karhumaki Turku Centre for Computer Science TUCS Technical Reports No 446…
- Add To MetaCart
-
Copying quantum computer makes NP-complete problems tractable
- …Copying quantum computer makes NP-complete problems tractable Mika Hirvensalo Turku Centre…
- Add To MetaCart
-
Generalized PCP Is Decidable for Marked Morphisms
- … of Mathematics, University of Turku FIN-20014 Turku, Finland. E-mail: harju@utu. Mika Hirvensalo Department…
- Cited by 2 (2 self) – Add To MetaCart
-
Quantum Error Correction
- …Quantum error correction Mika Hirvensalo Turku Centre for Computer Science TUCS Technical Report…
- Cited by 1 (0 self) – Add To MetaCart
-
Binary (Generalized) Post Correspondence Problem
- …@(email omitted); Mika Hirvensalo Department of Mathematics, University of Turku FIN-20014 Turku, Finland also TUCS…
- Cited by 10 (5 self) – Add To MetaCart
-
Positivity of Second Order Linear Recurrent Sequences
- …Positivity of Second Order Linear Recurrent Sequences Vesa Halava ∗ , Tero Harju and Mika…
- Cited by 1 (0 self) – Add To MetaCart
-
Computing with Quanta - Impacts of Quantum Theory on Computation
- …Computing with Quanta { Impacts of Quantum Theory on Computation Mika Hirvensalo Turku Centre…
- Add To MetaCart
-
Marked PCP is Decidable
- …Marked PCP is Decidable Vesa Halava a , Mika Hirvensalo b;a;1 , Ronald de Wolf c;d a Turku…
- Add To MetaCart
-
(G)PCP for words of length at most two
- …, University of Turku FIN-20014 Turku, Finland and TUCS - Turku Centre for Computer Science Mika Hirvensalo…
- Add To MetaCart
-
Decidability and Undecidability of Marked PCP
- …, Lemmink#isenkatu 14 A, 4th AEoor FIN-20520 Turku, Finland. e-mail: vehalava@(email omitted);. Mika Hirvensalo…
- Cited by 4 (3 self) – Add To MetaCart
Showing 1 through 10.
