Stop the war!
Остановите войну!
for scientists:
default search action
"On Complexity of Regular (1, +k)-Branching Programs."
Farid M. Ablayev (2000)
- Farid M. Ablayev:
On Complexity of Regular (1, +k)-Branching Programs. ICALP Satellite Workshops 2000: 229-240
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.