{"id":"https://openalex.org/W1493769112","doi":"https://doi.org/10.1007/s002240000109","title":"On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions","display_name":"On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W1493769112","doi":"https://doi.org/10.1007/s002240000109","mag":"1493769112"},"language":"en","primary_location":{"id":"doi:10.1007/s002240000109","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s002240000109","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5445/ir/78097","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110628039","display_name":"Bernd Borchert","orcid":null},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"B. Borchert","raw_affiliation_strings":["Mathematisches Institut, INF 294,   Universit\u00e4t Heidelberg, 69120 Heidelberg, Germany  bb@math.uni-heidelberg.de, fstephan@math.uni-heidelberg.de, , , , , , DE","Mathematisches Institut, INF 294, Universit\u00e4t Heidelberg, 69120 Heidelberg, Germany bb@math.uni-heidelberg.de, fstephan@math.uni-heidelberg.de, DE"],"affiliations":[{"raw_affiliation_string":"Mathematisches Institut, INF 294,   Universit\u00e4t Heidelberg, 69120 Heidelberg, Germany  bb@math.uni-heidelberg.de, fstephan@math.uni-heidelberg.de, , , , , , DE","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"Mathematisches Institut, INF 294, Universit\u00e4t Heidelberg, 69120 Heidelberg, Germany bb@math.uni-heidelberg.de, fstephan@math.uni-heidelberg.de, DE","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109076888","display_name":"Desh Ranjan","orcid":null},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Ranjan, F. Stephan","raw_affiliation_strings":["Department of Computer Science, Science Hall 159, New Mexico State University, Las Cruces, NM 88011, USA dranjan@cs.nmsu.edu, MX"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Science Hall 159, New Mexico State University, Las Cruces, NM 88011, USA dranjan@cs.nmsu.edu, MX","institution_ids":["https://openalex.org/I10052268"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110628039"],"corresponding_institution_ids":["https://openalex.org/I223822909"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0202,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.73055262,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"6","first_page":"679","last_page":"693"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.616328239440918},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6138669848442078},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5918444395065308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5818967223167419},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5689142942428589},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5612824559211731},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5353560447692871},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.47497838735580444},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.46474429965019226},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.46073219180107117},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.46025004982948303},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45413336157798767},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.45243316888809204},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.44660666584968567},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.4140656590461731},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.41089457273483276},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.37475988268852234},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.37082239985466003},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.3591880798339844},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3365064859390259},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18533068895339966},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18286001682281494}],"concepts":[{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.616328239440918},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6138669848442078},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5918444395065308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5818967223167419},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5689142942428589},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5612824559211731},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5353560447692871},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.47497838735580444},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.46474429965019226},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.46073219180107117},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.46025004982948303},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45413336157798767},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.45243316888809204},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.44660666584968567},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.4140656590461731},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.41089457273483276},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.37475988268852234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37082239985466003},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.3591880798339844},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3365064859390259},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18533068895339966},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18286001682281494},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s002240000109","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s002240000109","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.5946","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.5946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-fs.informatik.uni-tuebingen.de/~borchert/papers/Borchert-Ranjan-Stephan_1998_equivalence-classes.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.7065","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.7065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://math.uni-heidelberg.de/logic/bb/papers/Boolean-isomorphism.ps","raw_type":"text"},{"id":"pmh:oai:EVASTAR-Karlsruhe.de:78097","is_oa":false,"landing_page_url":"https://publikationen.bibliothek.kit.edu/78097","pdf_url":null,"source":{"id":"https://openalex.org/S4306401992","display_name":"Repository KITopen (Karlsruhe Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:book"},{"id":"doi:10.5445/ir/78097","is_oa":true,"landing_page_url":"https://doi.org/10.5445/ir/78097","pdf_url":null,"source":{"id":"https://openalex.org/S7407052948","display_name":"KITopen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"book"},{"id":"mag:1493769112","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc3.html#ECCC-TR96-033","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"doi:10.5445/ir/78097","is_oa":true,"landing_page_url":"https://doi.org/10.5445/ir/78097","pdf_url":null,"source":{"id":"https://openalex.org/S7407052948","display_name":"KITopen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"book"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W191630204","https://openalex.org/W1517585663","https://openalex.org/W1560182867","https://openalex.org/W1605345553","https://openalex.org/W2029980187","https://openalex.org/W2033323875","https://openalex.org/W2049571876","https://openalex.org/W2049817705","https://openalex.org/W2057033083","https://openalex.org/W2068422506","https://openalex.org/W2130219986","https://openalex.org/W2140053302","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W1997240046","https://openalex.org/W73036762","https://openalex.org/W2155885599","https://openalex.org/W2089857781","https://openalex.org/W2078940883","https://openalex.org/W2029109849","https://openalex.org/W2101429643","https://openalex.org/W2017143494","https://openalex.org/W2398485441","https://openalex.org/W59112699","https://openalex.org/W2950925424","https://openalex.org/W1499975475","https://openalex.org/W2058853326","https://openalex.org/W2170831059","https://openalex.org/W1969803220","https://openalex.org/W2567822474","https://openalex.org/W2137442467","https://openalex.org/W3134996725","https://openalex.org/W2565115296","https://openalex.org/W3177031355"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}