Stop the war!
Остановите войну!
for scientists:
default search action
"Upper bounds for the complexity of sequences generated by symmetric ..."
Yuri V. Merekin (2001)
- Yuri V. Merekin:
Upper bounds for the complexity of sequences generated by symmetric Boolean functions. Discret. Appl. Math. 114(1-3): 227-231 (2001)
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.