Imagen de Portada

NP-Completeness of Multicast Beamforming in Wireless Communication

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Shrestha, Sagar
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Wataridori is NP-Complete
por: Ruangwises, Suthee
Publicado: (2026)

Nondango is NP-Complete
por: Ruangwises, Suthee
Publicado: (2023)

NP-Completeness of Neighborhood Balanced Colorings
por: Asaeedi, Saeed
Publicado: (2024)

The 2-Attractor Problem is NP-Complete
por: Fuchs, Janosch, et al.
Publicado: (2023)

Communication Complexity is NP-hard
por: Hirahara, Shuichi, et al.
Publicado: (2025)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
por: Gaspers, Serge, et al.
Publicado: (2025)

Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
por: Digulescu, Mircea-Adrian
Publicado: (2026)

An Oracle with no $\mathrm{UP}$-Complete Sets, but $\mathrm{NP}=\mathrm{PSPACE}$
por: Dingel, David, et al.
Publicado: (2024)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
por: Ruangwises, Suthee
Publicado: (2024)

Recognizing Sumsets is NP-Complete
por: Abboud, Amir, et al.
Publicado: (2024)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
por: Otsuji, Taisei, et al.
Publicado: (2026)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
por: Grüne, Christoph, et al.
Publicado: (2026)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
por: Kiatchaipipat, Nattapol, et al.
Publicado: (2025)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
por: Nederlof, Jesper
Publicado: (2026)

P=NP
por: Deng, Zikang
Publicado: (2024)

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
por: Minevich, Igor, et al.
Publicado: (2024)

P vs. NP
por: Uribe, Daniel
Publicado: (2016)

On P Versus NP
por: Gordeev, Lev
Publicado: (2020)

On $NP \cap coNP$ proof complexity generators
por: Krajicek, Jan
Publicado: (2025)

Proofs of NP = coNP = PSPACE: Current upgrade
por: Gordeev, Lev, et al.
Publicado: (2023)

A Critique of Lin's "On $\text{NP}$ versus $\text{coNP}$ and Frege Systems"
por: DeJesse, Nicholas, et al.
Publicado: (2025)

BusOut is NP-complete
por: Ishibashi, Takehiro, et al.
Publicado: (2025)

On Kernelization with Access to NP-Oracles
por: Molter, Hendrik, et al.
Publicado: (2025)

Thin Tree Verification is coNP-Complete
por: Moayyedi, Alice
Publicado: (2025)

A Critique of Deng's "P=NP"
por: Humphreys, Isabel, et al.
Publicado: (2025)

No Complete Problem for Constant-Cost Randomized Communication
por: Fang, Yuting, et al.
Publicado: (2024)

Some conditions implying if P=NP then P=PSPACE
por: Rodriguez, Ismael
Publicado: (2026)

Optimizing for aggressive-style strategies in Flesh and Blood is NP-hard
por: Romão, Leonardo Gasparini, et al.
Publicado: (2025)

The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
por: Meng, Boning, et al.
Publicado: (2025)

On the NP-Hardness Approximation Curve for Max-2Lin(2)
por: Martinsson, Björn
Publicado: (2024)

Limits of structures and Total NP Search Problems
por: Ježil, Ondřej
Publicado: (2023)

The 7 faces of quantum NP
por: Gharibian, Sevag
Publicado: (2023)

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
por: Çivril, Ali
Publicado: (2021)

Limit-sure reachability for small memory policies in POMDPs is NP-complete
por: Asadi, Ali, et al.
Publicado: (2024)

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
por: Baraskar, Omkar, et al.
Publicado: (2024)

Determining unit distance graphs with coordinates in $\mathbb{Z}^2$ is NP-complete
por: Binnendyk, Eric
Publicado: (2025)

King Chasing Problem in Chinese Chess is NP-hard
por: Li, Chao, et al.
Publicado: (2026)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
por: Lee, Changryeol
Publicado: (2026)

NP-hardness of SVP in Euclidean Space
por: Wan, Daqing
Publicado: (2026)

Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard
por: Krokhin, Andrei, et al.
Publicado: (2025)