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.
Proof Complexity and Feasible Arithmetic. New York: AMS, 1998 - (Buss, S.), s. 279-296. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 39
http://hdl.handle.net/11104/0071522
Number of the records: 1