On the computational complexity of some classical equivalence relations on boolean functions
type: Item
instance of: scholarly article
title: On the computational complexity of some classical equivalence relations on boolean functions
zbMATH Open document ID: 0916.68059
author: K. Appert
published in: Theory of Computing Systems
publication date: 1999-01-03T00:00:00Z
full work available at URL: https://publikationen.bibliothek.kit.edu/78097/2796
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1234634
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
OpenAlex ID: W1997240046
DOI: 10.1007/S002240000109
Recommended article: On complexity of a particular Boolean functions class
Recommended article: On the complexity of restrictions of Boolean functions
Recommended article: Boolean complexity classes vs. their arithmetic analogs
Recommended article: On Equivalence Classes of Boolean Functions
Recommended article: On estimates on the complexity of restrictions of Boolean functions
Recommended article: Complexity classes of equivalence problems revisited
Recommended article: Q3318682
Recommended article: On the complexity of balanced Boolean functions
Recommended article: Q4530739
Recommended article: Q4036699
description: scientific article; zbMATH DE number 1234634