A Polynomial-Time Algorithm to Approximately Count Contingency Tables When the Number of Rows Is Constant

doi 10.1145/509943.509946
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

The Price of Privately Releasing Contingency Tables and the Spectra of Random Matrices With Correlated Rows

2010English

A Polynomial Time Algorithm to Compute Quantum Invariants of 3-Manifolds With Bounded First Betti Number.

2017English

A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time

2019English

A Polynomial Time Algorithm for Fault Diagnosability

1984English

The Application of Canonical Correlation to Two-Dimensional Contingency Tables

Tutorials in Quantitative Methods for Psychology
2010English

A Polynomial-Time Algorithm for Global Value Numbering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Unified Approach for the Multivariate Analysis of Contingency Tables

Open Journal of Statistics
2015English

A Polynomial-Time Parsing Algorithm for TT-MCTAG

2009English

A Polynomial-Time Algorithm to Approximate the Mixed Volume Within a Simply Exponential Factor

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy