Study programme
Classes
- Seminar on Logic INAIL056 | Faculty of Mathematics and Physics
- Seminar on Logic IINAIL080 | Faculty of Mathematics and Physics
- Introduction to Mathematical LogicNMAG162 | Faculty of Mathematics and Physics
- Logic and ComplexityNMAG446 | Faculty of Mathematics and Physics
- Proof Complexity and the P vs. NP ProblemNMAG536 | Faculty of Mathematics and Physics
- Students' Seminar on LogicNMMB453 | Faculty of Mathematics and Physics
Publications
- CONSISTENCY OF CIRCUIT LOWER BOUNDS WITH BOUNDED THEORIES2020 | 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
- PSEUDO-FINITE HARD INSTANCES FOR A STUDENT-TEACHER GAME WITH A NISAN-WIGDERSON GENERATOR2012 | Faculty of Mathematics and Physics
- The Cook-Reckhow definition2023 | Faculty of Mathematics and Physics
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH2022 | Faculty of Mathematics and Physics
- Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms2021 | Faculty of Mathematics and Physics
- A LIMITATION ON THE KPT INTERPOLATION2020 | Faculty of Mathematics and Physics
- PROOF COMPLEXITY2019 | Faculty of Mathematics and Physics
- On monotone circuits with local oracles and clique lower bounds2019 | Faculty of Mathematics and Physics
Loading network view...