8 citations · 14 across the 11 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023
Can You Solve Closest String Faster than Exhaustive Search?
Amir Abboud, Nick Fischer, Elazar Goldenberg +2
We study the fundamental problem of finding the best string to represent a given set, in the form of the Closest String problem: Given a set of strings, find…
cs.CC2020
The Computational Complexity of Plethysm Coefficients
Nick Fischer, Christian Ikenmeyer
In two papers, Bürgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) t…