Počet záznamů: 1
Prague Bounded Arithmetic Workshop 2017
- 1.0488110 - MÚ 2018 RIV eng U - Uspořádání akce
Thapen, Neil - Pudlák, Pavel
Prague Bounded Arithmetic Workshop 2017.
[Prague, 02.11.2017-03.11.2017, (W-WRD 30/19)]
GRANT EU: European Commission(XE) 339691 - FEALORA
Institucionální podpora: RVO:67985840
Klíčová slova: logic * bounded arithmetic * computational complexity
Obor OECD: Pure mathematics
https://calendar.math.cas.cz/content/prague-bounded-arithmetic-workshop-2017
Bounded arithmetic is an area in logic that is closely related to computational complexity. It studies weak fragments of Peano Arithmetic associated with complexity classes. The aim is to capture the reasoning that only uses concept of the corresponding computational complexity.
Trvalý link: http://hdl.handle.net/11104/0282728
Počet záznamů: 1