Markov bases of three-way tables are arbitrarily complicated (Q2457324): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jesús A. De Loera / rank
Normal rank
 
Property / author
 
Property / author: Jesús A. De Loera / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2005.04.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004380822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On properties of multi-dimensional statistical tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Three-Way Statistical Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic algorithms for sampling from conditional distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov bases for decomposable graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Theoretic Approach to Statistical Data Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner bases and polyhedral geometry of reducible and cyclic models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional Statistical Data Security Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Lawrence configurations. / rank
 
Normal rank

Latest revision as of 10:33, 27 June 2024

scientific article
Language Label Description Also known as
English
Markov bases of three-way tables are arbitrarily complicated
scientific article

    Statements

    Markov bases of three-way tables are arbitrarily complicated (English)
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    Contingency tables
    0 references
    Markov bases
    0 references
    statistical data security
    0 references
    sampling and random generation
    0 references
    confidentiality of statistical data
    0 references
    transportation polytopes
    0 references

    Identifiers