- Polynomial Equations and Convex Polytopes Bernd Sturmfels Thu 20 October 2022
- Using Determinancy of Games to Eliminate Quantifiers J. Richard Buchi Tue 18 October 2022
- The complexity of computing the permanent L.G. Valiant Tue 18 October 2022
- The complexity of two problems on arithmetic circuits Pascal Koiran Sylvain Perifel Tue 18 October 2022
- A functional programming language for sets with atom Michał Szynwelski Mon 17 October 2022
- Fairness and promptness in Muller formulas Youssouf Oualhadj Léo Tible Daniele Varacca Mon 17 October 2022
- One-to-Two-Player Lifting for Mildly Growing Memory Alexander Kozachinskiy Mon 17 October 2022
- The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Robert Ganian Thekla Hamm Viktoriia Korchemna Karolina Okrasa Kirill Simonov Mon 17 October 2022
- Descriptive complexity of the generalized spectra of graphs Aida Abiad Anuj Dawar Octavio Zapata Mon 17 October 2022
- When are Local Queries Useful for Robust Learning Pascale Gourdeau Varun Kanade Marta Kwiatkowska James Worrell Mon 17 October 2022
- Some Tribonacci Conjectures Jeffrey Shallit Mon 17 October 2022
- Solving Infinite Games in the Baire Space Benedikt Brutsch Wolfgang Thomas Sun 09 October 2022
- Hiding pebbles when the output alphabet is unary Gaetan Douéneau-Tabot Sun 09 October 2022
- The Geometry of Reachability in Continuous Vector Addition Systems with States Shaull Almagor Arka Ghosh Tim Leys Guillermo A. Perez Sun 09 October 2022
- A generic polynomial time approach to separation by first-order logic without quantifier alternation Thomas Place Marc Zeitoun Sun 09 October 2022
- Order-theoretic trees: monadic second-order descriptions and regularity Bruno Courcelle Sun 09 October 2022
- Pushdown Automata and Context-Free Grammars in Bisimulation Semantics Jos C. M. Baeten Cesare Carissimo Bas Luttik Sun 09 October 2022
- On Rational Recursive Sequences Lorenzo Clemente Maria Donten-Bury Filip Mazowiecki Michał Pilipczuk Sun 09 October 2022
- Pebble minimization: the last theorems Gaetan Douéneau-Tabot Sun 09 October 2022
- Non-closure under complementation for unambiguous linear grammars Olga Martynova Alexander Okhotin Sun 09 October 2022
Library Size: 13G (12949 entries),
Last Updated: Apr 11, 2026, 18:05:34,
Build Time: N/A
