 | Up a level |
Bläser, Markus, Ikenmeyer, Christian, Mahajan, Meena, Pandey, Anurag and Saurabh, Nitin
(2020)
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
In: 35th Computational Complexity Conference (CCC 2020).
Bläser, Markus, Ikenmeyer, Christian, Mahajan, Meena, Pandey, Anurag and Saurabh, Nitin
(2020)
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
Electronic Colloquium on Computational Complexity (ECCC), 18 (39).
p. 31.
Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor 
ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020)
Computing Maximum Matchings in Temporal Graphs.
In: STACS.
Fearnley, John, Palvolgyi, Domotor and Savani, Rahul ORCID: 0000-0003-1262-7831
(2022)
A Faster Algorithm for Finding Tarski Fixed Points.
ACM TRANSACTIONS ON ALGORITHMS, 18 (3).
29:1-29:1.
Bläser, Markus, Dörfler, Julian and Ikenmeyer, Christian
(2021)
On the Complexity of Evaluating Highest Weight Vectors.
In: 36th Computational Complexity Conference (CCC 2021).
Bläser, Markus, Dörfler, Julian and Ikenmeyer, Christian
(2020)
On the complexity of evaluating highest weight vectors.
[Preprint]
Bläser, Markus, Ikenmeyer, Christian, Lysikov, Vladimir, Pandey, Anurag and Schreyer, Frank-Olaf
(2019)
Variety Membership Testing, Algebraic Natural Proofs, and Geometric
Complexity Theory.
CoRR, abs/19.