Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q503454
Set OpenAlex properties.
 
(6 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Thomas Thierauf / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Leibniz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1708.02222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polynomially Bounded Perfect Matching Problem Is in NC 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kuratowski's and Wagner's theorems for matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Two Disjoint Paths in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Planar Reachability Is in Unambiguous Log-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coflow polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and multidimensional matching in chordal and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministically isolating a perfect matching in bipartite planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On box-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite perfect matching is in quasi-NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear matroid intersection is in quasi-NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle cover ratio of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Chebyshev-Type Inequalities for Primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5484515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Nondeterminism Unambiguous / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy, optimization and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial bound on the number of light cycles in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of shortest cycles and the chromatic uniqueness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theory for matroids. V: Testing of matrix total unimodularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices with exponentially large kissing numbers / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3141846633 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:21, 30 July 2024

scientific article; zbMATH DE number 7333148
Language Label Description Also known as
English
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
scientific article; zbMATH DE number 7333148

    Statements

    Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (English)
    0 references
    0 references
    0 references
    0 references
    14 April 2021
    0 references
    isolation lemma
    0 references
    derandomization
    0 references
    totally unimodular
    0 references
    short lattice vectors
    0 references
    regular matroids
    0 references
    box-TDI polytopes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references