Jonas Conneryd
Scholar

Jonas Conneryd

Google Scholar ID: yDeYDTkAAAAJ
PhD Student, Lund University
Proof complexitycomputational complexity theory
Citations & Impact
All-time
Citations
3
 
H-index
1
 
i10-index
0
 
Publications
1
 
Co-authors
4
list available
Publications
2 items
Resume (English only)
Research Experience
  • Advisor: Tatyana Turova.
Background
  • Fifth-year PhD student in theoretical computer science at Lund University. Research interests include computational complexity theory, particularly proof complexity. Particularly interested in understanding the complexity of (random) constraint satisfaction problems.