scientific article; zbMATH DE number 5320331

MaRDI QIDQ3522544zbMATH OpenFDO

Authors Román Orús

Publication date 3 September 2008

Full work available at URL https://arxiv.org/abs/quant-ph/0502022

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 175833
• Two QCMA-complete problems
• scientific article; zbMATH DE number 2012168
• scientific article; zbMATH DE number 7250160
• Cryptocomplexity and NP-completeness
• Separation of NP-completeness notions
• NP-Completeness, Proof Systems, and Disjoint NP-Pairs.
• Trahtenbrot-Zykov problem and NP-completeness
• scientific article; zbMATH DE number 1072533
• A Natural NP-Complete Problem with a Nontrivial Lower Bound

Cited in

(4)

• RAMP for the capacitated minimum spanning tree problem
• NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
• Computing quantum discord is NP-complete
• NP-completeness of the energy barrier problem without pseudoknots and temporary arcs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522544)