Publications | Lund University Publications

1 – 10 of 10

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/publication?embed=1&q=keywords+exact+%22lower+bounds%22&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

2023
Mark Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
Berkholz, Christoph and Nordström, Jakob ^LU (2023) In Journal of the ACM 70(5).
- Contribution to journal › Article
2022
Mark Lower bounds for Boolean circuits of bounded negation width
Jukna, Stasys and Lingas, Andrzej ^LU (2022) In Journal of Computer and System Sciences 129. p.90-105
- Contribution to journal › Article
2021
Mark Automating algebraic proof systems is NP-hard
De Rezende, Susanna F. ^LU ; Göös, Mika ; Nordström, Jakob ^LU ; Pitassi, Toniann ; Robere, Robert and Sokolov, Dmitry ^LU (2021) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 In Proceedings of the Annual ACM Symposium on Theory of Computing p.209-222
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2019
Mark Lower bounds for Demorgan circuits of bounded negation width
Jukna, Stasys and Lingas, Andrzej ^LU (2019) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 In Leibniz International Proceedings in Informatics, LIPIcs 126.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2016
Mark Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler - Leman Refinement Steps
Berkholz, Christoph and Nordström, Jakob ^LU (2016) 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016 In Proceedings - Symposium on Logic in Computer Science 05-08-July-2016. p.267-276
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2015
Mark Space complexity in polynomial calculus
Filmus, Yuval ; Lauria, Massimo ; Nordström, Jakob ^LU ; Ron-Zewi, Noga and Thapen, Neil (2015) In SIAM Journal on Computing 44(4). p.1119-1153
- Contribution to journal › Article
2005
Mark Unequal error protection explained by state-transition graphs
Pavlushkov, Victor ^LU ; Johannesson, Rolf ^LU and Zyablov, V (2005) IEEE International Symposium on Information Theory (ISIT), 2005 p.2236-2240
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2002
Mark Lower bounds for approximate polygon decomposition and minimum gap
Gudmundsson, J ; Husfeldt, Thore ^LU and Levcopoulos, Christos ^LU (2002) In Information Processing Letters 81(3). p.137-141
- Contribution to journal › Article
Mark Optimal graph exploration without good maps
Dessmark, Anders ^LU and Pelc, A. (2002) Algorithms - ESA 2002. 10th Annual European Symposium. Proceedings 2461. p.374-386
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
1996
Mark Continuity and Positivity Problems in Pseudo-differential Calculus
Toft, Joachim ^LU (1996)
- Thesis › Doctoral thesis (monograph)

your query:: Remove keywords: lower bounds