Sökning: "Mladen Mikša"
Hittade 1 avhandling innehållade orden Mladen Mikša.
1. On Complexity Measures in Polynomial Calculus
Sammanfattning : Proof complexity is the study of different resources that a proof needs in different proof systems for propositional logic. This line of inquiry relates to the fundamental questions in theoretical computer science, as lower bounds on proof size for an arbitrary proof system would separate P from NP. LÄS MER
Resultatsidor:
1