( en | de | ru )

 

Disambiguation of "Shor, Peter W."

Author of the publication

copydeleteadd this publication to your clipboard
A New Proof of Cayley's Formula for Counting Labeled Trees.

. J. Comb. Theory A, 71 (1): 154-158 (1995)

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

Random Debaters and the Hardness of Approximating Stochastic Functions., , , and . SIAM J. Comput., 26 (2): 369-400 (1997)Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol., , , , , , and . ICS, page 20-31. Tsinghua University Press, (2010)On the Structure of the Scaffolding Core of Bacteriophage T4., , , and . J. Comput. Biol., 6 (1): 1-12 (1999)The adaptive classical capacity of a quantum channel, or Information capacities of three symmetric pure states in three dimensions.. IBM J. Res. Dev., 48 (1): 115-138 (2004)Remote preparation of quantum states., , , , and . IEEE Trans. Inf. Theory, 51 (1): 56-74 (2005)Progress in Quantum Algorithms.. Quantum Inf. Process., 3 (1-5): 5-13 (2004)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)Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem., , , and . IEEE Trans. Inf. Theory, 48 (10): 2637-2655 (2002)Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.. SIAM Rev., 41 (2): 303-332 (1999)Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions., , , and . Chic. J. Theor. Comput. Sci., (1995)