Study programme
Classes
- Introduction to Mathematical LogicNMAG162 | Faculty of Mathematics and Physics
- Proof Complexity and the P vs. NP ProblemNMAG536 | Faculty of Mathematics and Physics
- Seminar on Logic INAIL056 | Faculty of Mathematics and Physics
- Seminar on Logic IINAIL080 | Faculty of Mathematics and Physics
- Logic and ComplexityNMAG446 | Faculty of Mathematics and Physics
- Students' Seminar on LogicNMMB453 | Faculty of Mathematics and Physics
Publications
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH2022 | Faculty of Mathematics and Physics
- A LIMITATION ON THE KPT INTERPOLATION2020 | Faculty of Mathematics and Physics
- PROOF COMPLEXITY2019 | Faculty of Mathematics and Physics
- A FEASIBLE INTERPOLATION FOR RANDOM RESOLUTION2017 | Faculty of Mathematics and Physics
- On the computational complexity of finding hard tautologies2014 | Faculty of Mathematics and Physics
- A note on SAT algorithms and proof complexity2012 | Faculty of Mathematics and Physics
- A note on propositional proof complexity of some Ramsey-type statements, Archive for Mathematical Logic2011 | Faculty of Mathematics and Physics
- From Feasible Proofs to Feasible Computations2010 | Faculty of Mathematics and Physics
- A proof complexity generator2009 | Faculty of Mathematics and Physics
- Substitutions into propositional tautologies2007 | Faculty of Mathematics and Physics
Loading network view...