{"id":"https://openalex.org/W245258148","doi":"https://doi.org/10.1016/0020-0190(96)00077-4","title":"A subexponential exact learning algorithm for DNF using equivalence queries","display_name":"A subexponential exact learning algorithm for DNF using equivalence queries","publication_year":1996,"publication_date":"1996-07-01","ids":{"openalex":"https://openalex.org/W245258148","doi":"https://doi.org/10.1016/0020-0190(96)00077-4","mag":"245258148"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(96)00077-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00077-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5017977075","display_name":"Nader H. Bshouty","orcid":"https://orcid.org/0009-0007-7356-7824"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Nader H. Bshouty","raw_affiliation_strings":["Department of Computer Science, The University of Calgary, Calgary, Alberta, Canada T2N 1N4","Department of Computer Science, The University of Calgary, Calgary, Alberta, Canada, T2N 1N4#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Calgary, Calgary, Alberta, Canada T2N 1N4","institution_ids":["https://openalex.org/I168635309"]},{"raw_affiliation_string":"Department of Computer Science, The University of Calgary, Calgary, Alberta, Canada, T2N 1N4#TAB#","institution_ids":["https://openalex.org/I168635309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017977075"],"corresponding_institution_ids":["https://openalex.org/I168635309"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02932966,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"1","first_page":"37","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11550","display_name":"Text and Document Classification Technologies","score":0.939300000667572,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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","display_name":"Equivalence (formal languages)","score":0.8050501346588135},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5943278074264526},{"id":"https://openalex.org/keywords/disjunctive-normal-form","display_name":"Disjunctive normal form","score":0.5315523147583008},{"id":"https://openalex.org/keywords/probably-approximately-correct-learning","display_name":"Probably approximately correct learning","score":0.4886648952960968},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4809833765029907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4447425603866577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4407440423965454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43010014295578003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4163094460964203},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.41572606563568115},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3823970556259155},{"id":"https://openalex.org/keywords/computational-learning-theory","display_name":"Computational learning theory","score":0.2926478087902069},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24994680285453796},{"id":"https://openalex.org/keywords/active-learning","display_name":"Active learning (machine learning)","score":0.11572527885437012}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.8050501346588135},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5943278074264526},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.5315523147583008},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.4886648952960968},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4809833765029907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4447425603866577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4407440423965454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43010014295578003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4163094460964203},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.41572606563568115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3823970556259155},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.2926478087902069},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24994680285453796},{"id":"https://openalex.org/C77967617","wikidata":"https://www.wikidata.org/wiki/Q4677561","display_name":"Active learning (machine learning)","level":2,"score":0.11572527885437012},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0020-0190(96)00077-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00077-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.696","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cpsc.ucalgary.ca/~bshouty/PAPERS/DNF-subexponential.ps","raw_type":"text"},{"id":"mag:245258148","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc2.html#ECCC-TR95-060","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":null,"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2022135397","https://openalex.org/W4212971335","https://openalex.org/W4238893454","https://openalex.org/W4246994868","https://openalex.org/W4252861488","https://openalex.org/W4255663193","https://openalex.org/W6611399581"],"related_works":["https://openalex.org/W23410456","https://openalex.org/W2017139430","https://openalex.org/W129174014","https://openalex.org/W2050166670","https://openalex.org/W2033049828","https://openalex.org/W241077556","https://openalex.org/W119470586","https://openalex.org/W2014855496","https://openalex.org/W2012982765","https://openalex.org/W3777473","https://openalex.org/W2998008536","https://openalex.org/W1991299446","https://openalex.org/W172717665","https://openalex.org/W3203591206","https://openalex.org/W2039371991","https://openalex.org/W2028806856","https://openalex.org/W2963475516","https://openalex.org/W1872939840","https://openalex.org/W2069652878","https://openalex.org/W2182664692"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}