Study programme
Classes
- Logic and ComplexityNMAG446 | 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
- Introduction to Mathematical LogicNMAG162 | Faculty of Mathematics and Physics
- Students' Seminar on LogicNMMB453 | Faculty of Mathematics and Physics
Publications
- 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
- CONSISTENCY OF CIRCUIT LOWER BOUNDS WITH BOUNDED THEORIES2020 | 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
- Randomized feasible interpolation and monotone circuits with a local oracle2018 | Faculty of Mathematics and Physics
- Expansions of pseudofinite structures and circuit and proof complexity2016 | Faculty of Mathematics and Physics
- A REDUCTION OF PROOF COMPLEXITY TO COMPUTATIONAL COMPLEXITY FOR AC(0)[p] FREGE SYSTEMS2015 | Faculty of Mathematics and Physics
Loading network view...