Advanced search

Found 1 swedish dissertation matching the above criteria.

2. 1. Lower Bounds and Trade-offs in Proof Complexity

   Author : Susanna F. de Rezende; Jakob Nordström; Amit Chakrabarti; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Proof complexity; trade-offs; lower bounds; size; length; space; Computer Science; Datalogi;

   Abstract : Propositional proof complexity is a field in theoretical computer science that analyses the resources needed to prove statements. In this thesis, we are concerned about the length of proofs and trade-offs between different resources, such as length and space. READ MORE