z-logo
open-access-imgOpen Access
Computing The Permanent of (Some) Complex Matrices
Author(s) -
Pooja Mishra
Publication year - 2021
Publication title -
international journal of advanced research in science, communication and technology
Language(s) - English
Resource type - Journals
ISSN - 2581-9429
DOI - 10.48175/ijarsct-1182
Subject(s) - matrix (chemical analysis) , algorithm , complex matrix , mathematics , computer science , algebra over a field , pure mathematics , chemistry , chromatography , materials science , composite material
We present a deterministic algorithm, which, for any given 0 < s <1 and an n × n real or complex matrix A = (aij) such that |aij − 1| ≤ 0.19 for all i, j computes the permanent of A within relative error s in nO(lnn−lns) time. The method can be extended to computing hafnians and multidimensional permanents.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here