Search for dissertations about: "Susanna F. de Rezende"
Found 1 swedish dissertation containing the words Susanna F. de Rezende.
-
1. Lower Bounds and Trade-offs in Proof Complexity
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
Result pages:
1