Research output per year
Research output per year
Personal profile
Research
I am a PhD student in the MIAO group headed by Jakob Nordström. My research concerns computational complexity theory, and proof complexity in particular. I am interested in lower bounds as well as interconnections between proof complexity and query, circuit and communication complexity.
Fingerprint
Dive into the research topics where Jonas Conneryd is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Research output
- 1 Paper in conference proceeding
-
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
Conneryd, J., De Rezende, S. F., Nordstrom, J., Pang, S. & Risse, K., 2023, Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. IEEE Computer Society, p. 1-11 11 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review
Projects
- 1 Active
-
Proof Complexity
Conneryd, J. (Researcher), Nordström, J. (Supervisor) & de Rezende, S. (Assistant supervisor)
2021/11/01 → …
Project: Dissertation
Activities
- 1 Participation in workshop/ seminar/ course
-
Extended reunion of the program "Satisfiability: Theory, Practice, and Beyond" at the Simons Institute for the Theory of Computing, UC Berkeley
Conneryd, J. (Role not specified)
2023 Mar 21 → 2023 May 15Activity: Participating in or organising an event › Participation in workshop/ seminar/ course