arrow
Volume 3, Issue 1
Hyperchaos Synchronization Between two Different Hyperchaotic Systems

J. Info. Comput. Sci. , 3 (2008), pp. 69-72.

Export citation
  • Abstract
Permanent of a matrix is # p-hard problem shown by many authors. In this paper we present a parallel algorithm for evaluation of permanent of an n×n matrix with multi-processors.
  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JICS-3-69, author = {}, title = {Hyperchaos Synchronization Between two Different Hyperchaotic Systems}, journal = {Journal of Information and Computing Science}, year = {2024}, volume = {3}, number = {1}, pages = {69--72}, abstract = { Permanent of a matrix is # p-hard problem shown by many authors. In this paper we present a parallel algorithm for evaluation of permanent of an n×n matrix with multi-processors. }, issn = {1746-7659}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22786.html} }
TY - JOUR T1 - Hyperchaos Synchronization Between two Different Hyperchaotic Systems AU - JO - Journal of Information and Computing Science VL - 1 SP - 69 EP - 72 PY - 2024 DA - 2024/01 SN - 3 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22786.html KW - Permanent of matrix, Parallel Algorithm. AB - Permanent of a matrix is # p-hard problem shown by many authors. In this paper we present a parallel algorithm for evaluation of permanent of an n×n matrix with multi-processors.
. (2024). Hyperchaos Synchronization Between two Different Hyperchaotic Systems. Journal of Information and Computing Science. 3 (1). 69-72. doi:
Copy to clipboard
The citation has been copied to your clipboard