On Finding Small 2-Generating Sets

DOI10.1007/978-3-642-02882-3_38zbMath1248.68362OpenAlexW18372789MaRDI QIDQ5323086

Stéphane Vialette, Isabelle Fagnot, Guillaume Fertin

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_38

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Elementary theory of partitions (11P81)

Related Items (2)

Some algorithmic results for [2-sumset covers] ⋮ Optimal monomial quadratization for ODE systems

Cites Work

• Nonnegative integral subset representations of integer sets
• Optimization, approximation, and complexity classes
• Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
• Some APX-completeness results for cubic graphs
• On the representation of 1,2,..., n by sums
• Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
• The Minimum Substring Cover Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Finding Small 2-Generating Sets