|
| << previous |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 3 of 3 found articles
| Title: |
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions |
| Author: |
Borchert, B. Ranjan, D. Stephan, F. |
| Appeared in: |
Theory of computing systems |
| Paging: | Volume 31 (Inc.) nr. 6 pages 679-693 |
| Year: |
Inc. |
| Contents: | |
| Publisher: |
Springer-Verlag, Berlin/Heidelberg |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 3 of 3 found articles
| << previous |