Živný, Stanislav

1. Approximate Graph Colouring and the Crystal with a Hollow Shadow
   2022/11/06 by Ciardo, Lorenzo, Živný, Stanislav · 2 citations
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
2. The Sherali-Adams Hierarchy for Promise CSPs through Tensors
   2022/03/04 by Lorenzo Ciardo, Stanislav Živný, Ciardo, Lorenzo +1 · 1 citation
   Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Peroxisome Proliferator-Activated Receptors
3. A logarithmic approximation of linearly ordered colourings
   2024/04/30 by Håstad, Johan, Martinsson, Björn, Nakajima, Tamio-Vesa +1 · 2 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
4. The periodic structure of local consistency
   2024/06/28 by Lorenzo Ciardo, Ciardo, Lorenzo, Stanislav Živný +1 · 1 citation
   Computer Science · #Advanced Algebra and Logic #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #semigroups and automata theory
5. Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
   2025/01/21 by Nakajima, Tamio-Vesa, Verwimp, Zephyr, Wrochna, Marcin +1 · 1 citation
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics