Proof Complexity and Feasible Arithmetic

Number of the records: 1

1.

SYSNO	0174516
Title	Algebraic models of computation and interpolation for algebraic proof systems
Author(s)	Pudlák, Pavel (MU-W)_{RID, SAI} Sgall, Jiří (MU-W)_{RID, ORCID, SAI}
Source Title	Proof Complexity and Feasible Arithmetic. s. 279-296 / Buss S.R.. - New York : AMS, 1998
Edition	DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Document Type	Část monografie, knihy (kapitola)
Language	eng
Country	US
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