AI Chat AI Image Generator AI Video Text to Speech

Identities in twisted Brauer monoids

07/31/2022

∙

by N. V. Kitov, et al.

∙

∙

We show that it is co-NP-hard to check whether a given semigroup identity holds in the twisted Brauer monoid ℬ^τ_n with n≥5.

N. V. Kitov
2 publications
M. V. Volkov
2 publications

page 1

page 2

page 3

page 4

research

∙ 10/21/2019

Identities of the Kauffman Monoid K_4 and of the Jones monoid J_4

Kauffman monoids K_n and Jones monoids J_n, n=2,3,..., are two families ...

0 N. V. Kitov, et al. ∙

research

∙ 11/28/2017

Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes

Leafless elementary trapping sets (LETSs) are known to be the problemati...

0 Ali Dehghan, et al. ∙

research

∙ 01/17/2021

Unified Citizen Identity System Using Blockchain

The citizenship identities of a nation's occupants enable the state to i...

0 Sri Sai Abhishake Gopal Dasari, et al. ∙

research

∙ 10/09/2017

Two-player entangled games are NP-hard

We show that the maximum success probability of players sharing quantum ...

0 Anand Natarajan, et al. ∙

research

∙ 07/16/2022

A Singular Woodbury and Pseudo-Determinant Matrix Identities and Application to Gaussian Process Regression

We study a matrix that arises in a singular formulation of the Woodbury ...

0 Siavash Ameli, et al. ∙

research

∙ 07/23/2018

Maximum-Likelihood Network Reconstruction for SIS Processes is NP-Hard

The knowledge of the network topology is imperative to precisely describ...

0 Bastian Prasse, et al. ∙

research

∙ 02/08/2019

Detecting mixed-unitary quantum channels is NP-hard

A quantum channel is said to be a mixed-unitary channel if it can be exp...

0 Colin Do-Yan Lee, et al. ∙