- On deciding linear arithmetic constraints over p-adic integers for all primes Christoph Haase Alessio Mansutti Thu 22 July 2021
- A Polynomial time Algorithm for Hamilton Cycle with maximum Degree 3, 3SAT Lizhi Du Tue 20 July 2021
- On the complexity of H-coloring Pavol Hell Jaroslav Nešetřil Fri 16 July 2021
- Stackless Processing of Streamed Trees Corentin Barloy Filip Murlak Charles Paperman Thu 15 July 2021
- Preservation Theorems Through the Lens of Topology Aliaume Lopez Wed 14 July 2021
- Nonconstructive Tools for Proving Polynomial-Time Decidability Michael R. Fellows Michael A. Langston Tue 13 July 2021
- Isomorphism of Planar Graphs (Working Paper) J. E. Hopcroft R. E. Tarjan Tue 13 July 2021
- Planar Graph Isomorphism is in Log-Space Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner Tue 13 July 2021
- The Complexity of Planar Graph Isomorphism Jacobo Torán Fabian Wagner Tue 13 July 2021
- The Complexity of Planar Graph Isomorphism Jacobo Torán Fabian Wagner Tue 13 July 2021
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY Hing Leung Wed 07 July 2021
- Succinct representation of regular languages by boolean automata Ernst Leiss Wed 07 July 2021
- Decision problems for ømega-automata L. H. Landweber Tue 06 July 2021
- Recognizing Safety and Liveness Bowen Alpern Fred B. Schneider Tue 06 July 2021
- From complementation to certification Orna Kupferman Moshe Y. Vardi Tue 06 July 2021
- Certifying DFA Bounds for Recognition and Separation Orna Kupferman Nir Lavee Salomon Sickert Tue 06 July 2021
- Certifying Inexpressibility Orna Kupferman Salomon Sickert Tue 06 July 2021
- On the Shuffle of Timed Regular languages Olivier Finkel Fri 02 July 2021
- Deterministic and Game Separability for Regular Languages of Infinite Trees Lorenzo Clemente Michał Skrzypczak Fri 02 July 2021
- Topological extension of parity automata Michał Skrzypczak Fri 25 June 2021
Library Size: 13G (12951 entries),
Last Updated: Apr 13, 2026, 09:28:01,
Build Time: N/A
