"Researching the Complexity of Boolean Functions with Computers."

Kazuyuki Amano (2010)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition @ eatcs.org (open access)
- export record
  dblp key:
  - journals/eatcs/Amano10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Amano10
Kazuyuki Amano:
Researching the Complexity of Boolean Functions with Computers. Bull. EATCS 101: 64-91 (2010)

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.