"The Complexity of Deciding if a Boolean Function Can Be Computed by ..."

Heribert Vollmer (2009)

> Home

Details and statistics

DOI: 10.1007/S00224-007-9030-9

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Vollmer09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Vollmer09
Heribert Vollmer:
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. Theory Comput. Syst. 44(1): 82-90 (2009)

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.