{"id":"https://openalex.org/W1490387647","doi":"https://doi.org/10.3233/fi-1999-381203","title":"The Complexity of Identifying Large Equivalence Classes","display_name":"The Complexity of Identifying Large Equivalence Classes","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1490387647","doi":"https://doi.org/10.3233/fi-1999-381203","mag":"1490387647"},"language":"en","primary_location":{"id":"doi:10.3233/fi-1999-381203","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-1999-381203","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017408163","display_name":"Sven Skyum","orcid":null},"institutions":[{"id":"https://openalex.org/I866804994","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46","country_code":"ZA","type":"nonprofit","lineage":["https://openalex.org/I866804994"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Sven Skyum","raw_affiliation_strings":["BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus","(Correspd.) BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus.#TAB#"],"affiliations":[{"raw_affiliation_string":"BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus","institution_ids":[]},{"raw_affiliation_string":"(Correspd.) BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus.#TAB#","institution_ids":["https://openalex.org/I866804994"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016748313","display_name":"Gudmund Skovbjerg Frandsen","orcid":null},"institutions":[{"id":"https://openalex.org/I866804994","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46","country_code":"ZA","type":"nonprofit","lineage":["https://openalex.org/I866804994"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Gudmund S. Frandsen","raw_affiliation_strings":["BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus","BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus.#TAB#"],"affiliations":[{"raw_affiliation_string":"BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus","institution_ids":[]},{"raw_affiliation_string":"BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus.#TAB#","institution_ids":["https://openalex.org/I866804994"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006968747","display_name":"Peter Bro Miltersen","orcid":null},"institutions":[{"id":"https://openalex.org/I866804994","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46","country_code":"ZA","type":"nonprofit","lineage":["https://openalex.org/I866804994"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Peter Bro Miltersen","raw_affiliation_strings":["BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus","BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus.#TAB#"],"affiliations":[{"raw_affiliation_string":"BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus","institution_ids":[]},{"raw_affiliation_string":"BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus.#TAB#","institution_ids":["https://openalex.org/I866804994"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007480303","display_name":"Peter G. Binderup","orcid":null},"institutions":[{"id":"https://openalex.org/I866804994","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46","country_code":"ZA","type":"nonprofit","lineage":["https://openalex.org/I866804994"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Peter G. Binderup","raw_affiliation_strings":["BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus","BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus.#TAB#"],"affiliations":[{"raw_affiliation_string":"BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus","institution_ids":[]},{"raw_affiliation_string":"BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus.#TAB#","institution_ids":["https://openalex.org/I866804994"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017408163"],"corresponding_institution_ids":["https://openalex.org/I866804994"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.05730659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"38","issue":"1,2","first_page":"25","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5451807379722595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46743977069854736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46467453241348267},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43962612748146057},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3343735933303833}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5451807379722595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46743977069854736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46467453241348267},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43962612748146057},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3343735933303833}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/fi-1999-381203","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-1999-381203","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/9a301a50-b020-11df-8c1a-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/9a301a50-b020-11df-8c1a-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Skyum, S, Frandsen, G S, Miltersen, P B & Binderup, P G 1999, 'The Complexity of Identifying Large Equivalence Classes', Fundamenta Informaticae, vol. 38, no. 1-2, pp. 25-37. https://doi.org/10.3233/FI-1999-381203","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W29200525","https://openalex.org/W1510730180","https://openalex.org/W1542879348","https://openalex.org/W1599335667","https://openalex.org/W2006355640","https://openalex.org/W2023626992","https://openalex.org/W2072153301","https://openalex.org/W2074920973","https://openalex.org/W2592570088"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2],"at":[3,31],"least":[4,32],"3k\u22124/k(2k\u22123)(n/2)":[5],"\u2013":[6],"O(k)equivalence":[7],"tests":[8,18],"and":[9],"no":[10],"more":[11],"than":[12],"2/k":[13],"(n/2)":[14],"+":[15],"O(n)":[16],"equivalence":[17,28],"are":[19],"needed":[20],"in":[21,35],"the":[22,27],"worst":[23],"case":[24],"to":[25],"identify":[26],"classes":[29],"with":[30],"k":[33],"members":[34],"set":[36],"of":[37],"n":[38],"elements.":[39],"The":[40],"upper":[41],"bound":[42],"is":[43],"an":[44]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}