( en | de | ru )

 

Disambiguation of "Shor, Peter W."

Author of the publication

copydeleteadd this publication to your clipboard
On the Sum-of-Squares algorithm for bin packing.

, , , , , and . J. ACM, 53 (1): 1-65 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oded Lipa Shor

Hashem Shorafa

Sabine Short

Ahmed Shoreit

Andrey Shornikov

 

Other publications of authors with the same name

Generalized Planar Matching., , , , and . J. Algorithms, 11 (2): 153-184 (1990)Superadditivity of the classical capacity with limited entanglement assistance., , and . CoRR, (2017)A new relativistic orthogonal states quantum key distribution protocol., and . Quantum Inf. Comput., 14 (13-14): 1081-1088 (2014)Unstructured randomness, small gaps and localization., , , , and . Quantum Inf. Comput., 11 (9&10): 840-854 (2011)Random Debaters and the Hardness of Approximating Stochastic Functions., , , and . SIAM J. Comput., 26 (2): 369-400 (1997)Quantum and Super-quantum enhancements to two-sender, two-receiver channels., and . CoRR, (2017)Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version)., , , and . WADS, volume 382 of Lecture Notes in Computer Science, page 115-134. Springer, (1989)Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.. SIAM Rev., 41 (2): 303-332 (1999)Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem., , , and . IEEE Trans. Inf. Theory, 48 (10): 2637-2655 (2002)Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions., , , and . Chic. J. Theor. Comput. Sci., (1995)