Number of the records: 1
Proof Complexity and Feasible Arithmetic
- 1.PUDLÁK, Pavel, SGALL, Jiří. Algebraic models of computation and interpolation for algebraic proof systems. In: BUSS, S.R., ed. Proof Complexity and Feasible Arithmetic. New York: AMS, 1998, s. 279-296. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 39.
Number of the records: 1