Sökning: "Amit Chakrabarti"
Hittade 1 avhandling innehållade orden Amit Chakrabarti.
1. Lower Bounds and Trade-offs in Proof Complexity
Sammanfattning : 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. LÄS MER
Resultatsidor:
1