Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions
Home
Publications
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions
Authors:
BB
B. Borchert
B. Borchert
DR
D. Ranjan
D. Ranjan
FS
F. Stephan
F. Stephan
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 November 1998
journal article
research article
Published by
Springer Nature
in
Theory of Computing Systems
Vol. 31
(6)
,
679-693
DOI:
10.1007/s002240000109
Abstract
No abstract available
Keywords
COMPUTATIONAL COMPLEXITY
CLASSICAL EQUIVALENCE
POLYNOMIAL TIME
EQUIVALENCE RELATION
BOOLEAN FUNCTION
Cited
Cited by 24 articles
Scroll to top