9 citations · 40 across the 22 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Complexity of Simon's problem in classical sense
Hans Zantema
Simon's problem is a standard example of a problem that is exponential in classical sense, while it admits a polynomial solution in quantum computing. It is about a function fo…
cs.CC2009★ 7 cited
An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas
Olga Tveretina, Carsten Sinz, Hans Zantema
Haken proved that every resolution refutation of the pigeonhole formula has at least exponential size. Groote and Zantema proved that a particular OBDD computation of the pigeonhol…