[PDF][PDF] 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science

N Saxena, S Simon - 2020 - cs.emis.de
… The conference was originally planned to be held in BITS Pilani, KK Birla Goa Campus,
Goa, India. Due to the COVID-19 pandemic, the conference was held online from December …

[PDF][PDF] LIPIcs, Volume 182, FSTTCS 2020, Complete Volume

N Saxena, S Simon - … IARCS Annual Conference on Foundations …, 2020 - drops.dagstuhl.de
2020). The conference was originally planned to be held in BITS Pilani, KK Birla Goa
Campus, Goa, India. Due to the COVID-19 pandemic, the …

Maximum matching via maximal matching queries

C Konrad, KK Naidu, A Steward - 40th International Symposium …, 2023 - drops.dagstuhl.de
… , editors, 40th IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, KK Birla Goa

[HTML][HTML] Semantic flowers for good-for-games and deterministic automata

D Dell'Erba, S Schewe, Q Tang… - Information Processing …, 2024 - Elsevier
We present an innovative approach for capturing the complexity of ω-regular languages using
the concept of flowers. This semantic tool combines two syntax-based definitions, namely …

Graph Reconstruction via MIS Queries

C Konrad, C O'Sullivan, V Traistaru - arXiv preprint arXiv:2401.05845, 2024 - arxiv.org
We consider the Graph Reconstruction problem given only query access to the input graph
via a Maximal Independent Set oracle. In this setting, in each round, the player submits a …

BPL⊆ L-AC¹

K Cheng, Y Wang - 39th Computational Complexity Conference  …, 2024 - drops.dagstuhl.de
… BPL ⊆ NL, is a big open problem in theoretical computer science. It is well known that L ⊆
NL ⊆ … Now we will invoke Theorem 18, 19 by choosing parameter t properly according to the …

QRAT Polynomially Simulates Merge Resolution

S Chede, A Shukla - arXiv preprint arXiv:2107.09320, 2021 - arxiv.org
… Quantified Resolution Asymmetric Tautologies (QRAT) proof system is introduced in [18]
to capture the preprocessing steps performed by several QBF-solvers. It has been shown in [18] …

[PDF][PDF] BPL⊆ L-AC

K Cheng, Y Wang - 39th Computational Complexity Conference, 2024 - d-nb.info
… BPL⊆ NL, is a big open problem in theoretical computer science. It is well known that L⊆
NL⊆ L-… Now we will invoke Theorem 18, 19 by choosing parameter t properly according to the …

Natural colors of infinite words

R Ehlers, S Schewe - arXiv preprint arXiv:2207.11000, 2022 - arxiv.org
… A classical question in the theory of automata is how to define canonical representations of
… While the definition of the natural color of a word (for a given language) is the main technical

An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation

C Konrad, KK Naidu - … of the 2024 Annual ACM-SIAM Symposium on …, 2024 - SIAM
… oracle, in 40th IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, KK Birla Goa