Stop the war!
Остановите войну!
for scientists:
default search action
"A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement ..."
Mikhail A. Raskin (2018)
- Mikhail A. Raskin:
A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton. ICALP 2018: 138:1-138:11
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.