Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2508.12241 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911109090377728 |
|---|---|
| author | Shrestha, Sagar |
| author_facet | Shrestha, Sagar |
| contents | In this work, the classical problem of multi-cast beamforming in wireless communication is reconsidered. An existing work has shown that the multi-cast beamforming problem is NP-hard. In this project, we show that the corresponding decision problem for real channel matrices and beamformers is NP-complete. Finally, we carry out simulations to reveal the computational complexity of solving the NP-complete beamforming problem in various setting using SAT/SMT solvers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_12241 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | NP-Completeness of Multicast Beamforming in Wireless Communication Shrestha, Sagar Computational Complexity In this work, the classical problem of multi-cast beamforming in wireless communication is reconsidered. An existing work has shown that the multi-cast beamforming problem is NP-hard. In this project, we show that the corresponding decision problem for real channel matrices and beamformers is NP-complete. Finally, we carry out simulations to reveal the computational complexity of solving the NP-complete beamforming problem in various setting using SAT/SMT solvers. |
| title | NP-Completeness of Multicast Beamforming in Wireless Communication |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2508.12241 |