MathSciNet Relay Station
MathSciNet bibliographic data
MR1279412 68Q15 (65Y20)
Papadimitriou, Christos H. On the complexity of the parity argument and other inefficient proofs of existence. 31st Annual Symposium on Foundations of Computer Science (FOCS) (St. Louis, MO, 1990). J. Comput. System Sci. 48 (1994), no. 3, 498–532.
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2016, American Mathematical Society
Privacy Statement