"On the Computational Complexity of Some Classical Equivalence Relations on ..."

Bernd Borchert, Desh Ranjan, Frank Stephan (1998)

> Home

Details and statistics

DOI: 10.1007/S002240000109

access: closed

type: Journal Article

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/BorchertRS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BorchertRS98
Bernd Borchert, Desh Ranjan, Frank Stephan:
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. Theory Comput. Syst. 31(6): 679-693 (1998)

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.