Bounds on determinantal complexity of two types of generalized permanents

Theoretical Computer Science 2026 Open access

Read full text

Authors: Tristram Bogart, Juan Andrés Valero

DOI: 10.1016/j.tcs.2026.115862

Cited by: 0

References: 4

Fields of Study & Subjects

Complexity and Algorithms in Graphs Advanced Combinatorial Mathematics Advanced Graph Theory Research

References 4