{"id":"https://openalex.org/W4253228418","doi":"https://doi.org/10.1016/s0022-0000(03)00014-x","title":"A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant","display_name":"A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant","publication_year":2003,"publication_date":"2003-06-30","ids":{"openalex":"https://openalex.org/W4253228418","doi":"https://doi.org/10.1016/s0022-0000(03)00014-x"},"language":"en","primary_location":{"id":"doi:10.1016/s0022-0000(03)00014-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0022-0000(03)00014-x","pdf_url":"https://www.sciencedirect.com/science/article/pii/S002200000300014X/pdf","source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S002200000300014X/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057611636","display_name":"Mary Cryan","orcid":null},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Mary Cryan","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds LS2 9JT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds LS2 9JT, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019297501","display_name":"Martin Dyer","orcid":"https://orcid.org/0000-0002-2018-0374"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martin Dyer","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds LS2 9JT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds LS2 9JT, UK","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057611636"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":{"value":2650,"currency":"USD","value_usd":2650},"apc_paid":null,"fwci":0.6342,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.74060823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"67","issue":"2","first_page":"291","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9905999898910522,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/constant","display_name":"Constant (computer programming)","score":0.7126547694206238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6662279367446899},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.6176338195800781},{"id":"https://openalex.org/keywords/contingency-table","display_name":"Contingency table","score":0.48610877990722656},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4812357425689697},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4660758972167969},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43642523884773254},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4282219707965851},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.380740761756897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2653791308403015},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17448922991752625},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1038716733455658}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7126547694206238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6662279367446899},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.6176338195800781},{"id":"https://openalex.org/C91998498","wikidata":"https://www.wikidata.org/wiki/Q1541178","display_name":"Contingency table","level":2,"score":0.48610877990722656},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4812357425689697},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4660758972167969},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43642523884773254},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4282219707965851},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.380740761756897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2653791308403015},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17448922991752625},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1038716733455658},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0022-0000(03)00014-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0022-0000(03)00014-x","pdf_url":"https://www.sciencedirect.com/science/article/pii/S002200000300014X/pdf","source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/2ae9d7ca-b74c-47f8-8b09-d4d0db9b1d02","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/2ae9d7ca-b74c-47f8-8b09-d4d0db9b1d02","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryan, M & Dyer, M E 2003, 'A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant.', Journal of Computer and System Sciences, vol. 67, no. 2, pp. 291-310. https://doi.org/10.1016/S0022-0000(03)00014-X","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1016/s0022-0000(03)00014-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0022-0000(03)00014-x","pdf_url":"https://www.sciencedirect.com/science/article/pii/S002200000300014X/pdf","source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4253228418.pdf","grobid_xml":"https://content.openalex.org/works/W4253228418.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W568926409","https://openalex.org/W1970853627","https://openalex.org/W1990313671","https://openalex.org/W2013493321","https://openalex.org/W2039689894","https://openalex.org/W2041990574","https://openalex.org/W2062142815","https://openalex.org/W2063342497","https://openalex.org/W2066720893","https://openalex.org/W2072211488","https://openalex.org/W2073356044","https://openalex.org/W2079008867","https://openalex.org/W2088515005","https://openalex.org/W2104096499","https://openalex.org/W2129740858","https://openalex.org/W2140808818","https://openalex.org/W3111890340","https://openalex.org/W4230882475","https://openalex.org/W6603749998","https://openalex.org/W6606811147","https://openalex.org/W6631296161","https://openalex.org/W6636267979"],"related_works":["https://openalex.org/W2168242335","https://openalex.org/W2905020035","https://openalex.org/W4247024028","https://openalex.org/W4241249619","https://openalex.org/W2050486772","https://openalex.org/W2281029567","https://openalex.org/W2919086561","https://openalex.org/W4248638510","https://openalex.org/W2053809219","https://openalex.org/W2103890637"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}