APA Citation

Beckmann, A., & Buss, S. R. (2010). Characterising definable search problems in bounded arithmetic via proof notations. Ways of Proof Theory, 2, pp. 65-134. doi:10.1515/9783110324907.65

Chicago Style Citation

Beckmann, Arnold, and Samuel R. Buss. "Characterising Definable Search Problems in Bounded Arithmetic Via Proof Notations." Ways of Proof Theory 2 (2010): 65-134.

MLA Citation

Beckmann, Arnold, and Samuel R. Buss. "Characterising Definable Search Problems in Bounded Arithmetic Via Proof Notations." Ways of Proof Theory 2 (2010): 65-134.

Warning: These citations may not always be 100% accurate.