The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024（2024）
Key words
Fine-grained complexity theory,non-deterministic finite automata
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined