11 – 20 of 21
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
The power of negative reasoning
de Rezende, Susanna F. LU
; Lauria, Massimo
; Nordström, Jakob
LU
and Sokolov, Dmitry
LU
(2021)
36th Computational Complexity Conference, CCC 2021
In Leibniz International Proceedings in Informatics, LIPIcs
200.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2020
-
Mark
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
de Rezende, Susanna F. LU
; Nordström, Jakob
LU
; Risse, Kilian
and Sokolov, Dmitry
LU
(2020)
35th Computational Complexity Conference, CCC 2020
In Leibniz International Proceedings in Informatics, LIPIcs
169.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Lifting with simple gadgets and applications to circuit and proof complexity
De Rezende, Susanna LU
; Meir, Or
; Nordstrom, Jakob
LU
; Pitassi, Toniann
; Robere, Robert
and Vinyals, Marc
(2020)
61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020
In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2020-November.
p.24-30
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
KRW composition theorems via lifting
De Rezende, Susanna F. LU
; Meir, Or
; Nordstrom, Jakob
LU
; Pitassi, Toniann
and Robere, Robert
(2020)
61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020
In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2020-November.
p.43-49
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
Nullstellensatz size-degree trade-offs from reversible pebbling
De Rezende, Susanna F. LU
; Nordström, Jakob
LU
; Meir, Or
and Robere, Robert
(2019)
34th Computational Complexity Conference, CCC 2019
In Leibniz International Proceedings in Informatics, LIPIcs
137.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Clique is hard on average for regular resolution
Atserias, Albert ; Bonacina, Ilario ; De Rezende, Susanna F. LU
; Lauria, Massimo
; Nordström, Jakob
LU
and Razborov, Alexander
(2018)
50th Annual ACM Symposium on Theory of Computing, STOC 2018
In Proceedings of the Annual ACM Symposium on Theory of Computing
p.646-659
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Cumulative space in black-white pebbling and resolution
Alwen, Joël ; De Rezende, Susanna F. LU
; Nordström, Jakob
LU
and Vinyals, Marc
(2017)
8th Innovations in Theoretical Computer Science Conference, ITCS 2017
In Leibniz International Proceedings in Informatics, LIPIcs
67.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
De Rezende, Susanna F. LU
; Nordstrom, Jakob
LU
and Vinyals, Marc
(2016)
57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016
In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2016-December.
p.295-304
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2015
-
Mark
On the proper orientation number of bipartite graphs
Araujo, Julio ; Cohen, Nathann ; de Rezende, Susanna F. LU
; Havet, Frédéric
and Moura, Phablo F.S.
(2015)
In Theoretical Computer Science
566(C).
p.59-75
- Contribution to journal › Article
- 2013
-
Mark
Intersecting longest paths
De Rezende, Susanna F. LU
; Fernandes, Cristina G.
; Martin, Daniel M.
and Wakabayashi, Yoshiko
(2013)
In Discrete Mathematics
313(12).
p.1401-1408
- Contribution to journal › Article