Hirvensalo, Mika

name

• Hirvensalo, Mika

Authored works

• A method for computing the characteristic polynomial and determining semidefiniteness
• Computing partial information out of intractable : powers of algebraic numbers as an example
• Computing partial information out of uncomputable one : the first digit of 2[sup n] at base 3 as an example
• Computing with quanta : impacts of quantum theory on computation
• Copying quantum computer makes NP-complete problems tractable
• Improved undecidability results on the emptiness problem of probabilistic and quantum cut-point languages
• On quantum computation
• Quantum computing
• Quantum error correction
• Studies on Boolean functions related to quantum computing

Works contributed to

• Decidability and undecidability of marked PCP
• Generalized PCP is decidable for marked morphisms
• Improved matrix pair undecidability results
• On the generating function of discrete Chebyshev polynomials
• Positivity of second order linear recurrent sequences
• Recurrent construction of MacWilliams and Chebyshev matrices
• Undecidability bounds for integer matrices using Claus instances

Works about Hirvensalo, Mika