Number of the records: 1
Proof Complexity and Feasible Arithmetic
- 1.0174516 - MU-W 980024 RIV US eng M - Monography Chapter
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
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0071522
File Download Size Commentary Version Access Pudlak.pdf 1 279.5 KB Author’s postprint open-access
Number of the records: 1