MB
Markus Bläser
cs.CCcs.AIcs.DSmath.COcs.LOmath.RTquant-phcs.CRcs.SCmath.AG
On Valency
published · living versionsW_p5tfrsme·v1 · currentpublished
Deterministic Shift Equivalence Testing for Sparse Polynomials
with Pranjal Dutta, Sagnik Dutta, Gorav Jindal
1 version
W_cn6fa5jx·v1published
W_5sj46647·v2published
Preprints & journals
32 papers in the corpus · 2007–2026Simultaneous Matrix Multiplication by Tensor Contraction Aggregation2610.26563v2 · Edgar Solomonik, Markus Blaser2026 · 0 citationsarXivon Valency
Deterministic Shift Equivalence Testing for Sparse Polynomials2610.27168v1 · Markus Blaser, Pranjal Dutta, Sagnik Dutta et al.2026 · 0 citationsarXivon Valency
When Are Monomial Symmetric Polynomials Hard?2610.25181v1 · Markus Blaser, Radu Curticapean, Sagnik Dutta et al.2026 · 0 citationsarXivon Valency
Verifiable quantum advantage based on polynomials with planted structures2609.39918v1 · Markus Blaser, Michael Gullans, Dominik Hangleiter et al.2026 · 0 citationsarXiv
The Complexity of Bisimilarity and Model Checking in Finitary Diagrams2606.16744v1 · Markus Blaser, Sagnik Dutta, Samuel Okyay2026 · 0 citationsarXiv
On the Principal Minor Expansion and Complexity of the Symmetrized Determinant2604.28019v2 · Sanyam Agarwal, Markus Blaser, Mridul Gupta2026 · 0 citationsarXiv
Time complexity of a monitored quantum search with resetting2601.20560v1 · Emma C. King, Sayan Roy, Francesco Mattiotti et al.2026 · 0 citationsarXiv
Exponential lower bound via exponential sums2601.00387v3 · Somnath Bhattacharjee, Markus Blaser, Pranjal Dutta et al.2026 · 0 citationsarXiv
Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz2510.19704v2 · Markus Blaser, Sagnik Dutta, Gorav Jindal2025 · 0 citationsarXiv
Which graph motif parameters count?2507.12244v1 · Markus Blaser, Radu Curticapean, Julian Dorfler et al.2025 · 0 citationsarXiv
Probabilistic and Causal Satisfiability: Constraining the Model2504.19944v1 · Markus Blaser, Julian Dorfler, Maciej Li'skiewicz et al.2025 · 0 citationsarXiv
The Limits of Tractable Marginalization2506.12020v2 · Oliver Broadrick, Sanyam Agarwal, Guy Van den Broeck et al.2025 · 0 citationsarXiv
On average orders of automorphism groups of bilinear maps over finite fields2503.07299v1 · Markus Blaser, Yinan Li, Youming Qiao et al.2025 · 0 citationsarXiv
On the Complexity of Identification in Linear Structural Causal Models2407.12528v1 · Julian Dorfler, Benito van der Zander, Markus Blaser et al.2024 · 1 citationarXiv
From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy2405.07373v3 · Julian Dorfler, Benito van der Zander, Markus Blaser et al.2024 · 1 citationarXiv
The Existential Theory of the Reals with Summation Operators2405.04697v2 · Markus Blaser, Julian Dorfler, Maciej Liskiewicz et al.2024 · 0 citationsarXiv
Probabilistic Generating Circuits -- Demystified2404.02912v1 · Sanyam Agarwal, Markus Blaser2024 · 0 citationsarXiv
PosSLP and Sum of Squares2403.00115v1 · Markus Blaser, Julian Dorfler, Gorav Jindal2024 · 0 citationsarXiv
Identification for Tree-shaped Structural Causal Models in Polynomial Time2311.14058v2 · Aaryan Gupta, Markus Blaser2023 · 2 citationsarXiv
The Hardness of Reasoning about Probabilities and Causality2305.09508v1 · Benito van der Zander, Markus Blaser, Maciej Li'skiewicz2023 · 4 citationsarXiv
Identification in Tree-shaped Linear Structural Causal Models2203.01852v2 · Benito van der Zander, Marcel Wienobst, Markus Blaser et al.2022 · 1 citationarXiv
Algebraic Branching Programs, Border Complexity, and Tangent Spaces2003.04834v1 · Markus Blaser, Christian Ikenmeyer, Meena Mahajan et al.2020 · 2 citationsarXiv
On the complexity of evaluating highest weight vectors2002.11594v2 · Markus Blaser, Julian Dorfler, Christian Ikenmeyer2020 · 5 citationsarXiv
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory1911.02534v1 · Markus Blaser, Christian Ikenmeyer, Vladimir Lysikov et al.2019 · 6 citationsarXiv
Parameterized Valiant's Classes1907.12287v2 · Markus Blaeser, Christian Engels2019 · 0 citationsarXiv
Graph Pattern Polynomials1809.08858v1 · Markus Blaser, Balagopal Komarath, Karteek Sreenivasaiah2018 · 8 citationsarXiv
The border support rank of two-by-two matrix multiplication is seven1705.09652v1 · Markus Blaser, Matthias Christandl, Jeroen Zuiddam2017 · 2 citationsChicago Journal of Theoretical Computer Science 2018, article 05, pages 1-16
On degeneration of tensors and algebras1606.04253v1 · Markus Blaser, Vladimir Lysikov2016 · 145 citations41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), LIPIcs vol.58, pp. 19:1--19:11, 2016
Small Private Circuits1112.1308v2 · Markus Blaser, Jean-S'ebastien Coron, Alexey Pospelov2011 · 0 citationsarXiv
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth0902.1693v4 · Markus Blaser, Christian Hoffmann2009 · 10 citationsAlgorithmica, 61(1):3-35, 2011
Approximating Multi-Criteria Max-TSP0806.3668v1 · Markus Blaser, Bodo Manthey, Oliver Putz2008 · 12 citationsarXiv
On the Complexity of the Interlace Polynomial0707.4565v3 · Markus Blaser, Christian Hoffmann2007 · 23 citationsarXiv
Career total: 181 works. 32 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.