Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The complexity of Boolean functions in the Reed-Muller polynomials class."

V. P. Suprun (2017)

> Home

Details and statistics

DOI: 10.3103/S0146411617050078

access: closed

type: Journal Article

metadata version: 2020-05-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/accs/Suprun17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/accs/Suprun17
V. P. Suprun:
The complexity of Boolean functions in the Reed-Muller polynomials class. Autom. Control. Comput. Sci. 51(5): 285-293 (2017)

a service of

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.