Search results
- 1.0402118 - UIVT-O 940173 CZ eng V - Research Report
Pudlák, Pavel - Žák, Stanislav
Space Complexity of Computations.
Prague: ICS AS CR, 1994. 30 s. Technical Report, V-593.
Permanent Link: http://hdl.handle.net/11104/0122530File Download Size Commentary Version Access a0402118.pdf 5 1.7 MB Author’s postprint open-access - 2.0174477 - MU-W 970118 DE eng V - Research Report
Impagliazzo, R. - Pudlák, Pavel - Sgall, Jiří
Lower bounds for the polynomial calculus and the groebner basis algorithm.
Trier: Electronic Colloquium on Computational Complexity, 1997. 12 s.
R&D Projects: GA AV ČR IAA1019602
Permanent Link: http://hdl.handle.net/11104/0071483