QR-koda

Pebble Games, Proof Complexity, and Time-Space Trade-offs

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing...

Olles dieđut

Furkejuvvon:
Bibliográfalaš dieđut
Váldodahkki: Jakob Nordstrom
Materiálatiipa: Artigo
Giella:Inglês
Almmustuhtton: Logical Methods in Computer Science e.V. 2013-09-01
Ráidu:Logical Methods in Computer Science
Fáttát:
Liŋkkat:https://lmcs.episciences.org/1111/pdf
Fáddágilkorat: Lasit fáddágilkoriid
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!