Asymptotic behavior of Markov complexity (Q6199053): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jpaa.2023.107589 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4389937051 / 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: The Graver complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal systems of binomial generators and the indispensable complex of a toric ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov complexity of monomial curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov bases and generalized Lawrence liftings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov bases of three-way tables are arbitrarily complicated / 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: Lectures on algebraic statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the graver complexity of \(M\)-fold matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finiteness theorem for Markov bases of hierarchical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strongly robust property of toric ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5071029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bouquet algebra of toric ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph encodings of arbitrary toric ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Lawrence configurations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Markov complexity of book graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:08, 27 August 2024

scientific article; zbMATH DE number 7808737
Language Label Description Also known as
English
Asymptotic behavior of Markov complexity
scientific article; zbMATH DE number 7808737

    Statements

    Asymptotic behavior of Markov complexity (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    toric ideals
    0 references
    Markov complexity
    0 references
    Graver basis
    0 references
    Lawrence liftings
    0 references
    0 references
    0 references