178 citations · 179 across the 2 of their papers we have counts for
2 papers
cs.CC2015★ 1 cited
Combinatorial Game Complexity: An Introduction with Poset Games
Stephen A. Fenner, John Rogers
Poset games have been the object of mathematical study for over a century, but little has been written on the computational complexity of determining important properties of these…
cs.CC1998★ 178 cited
Complexity limitations on quantum computation
Lance Fortnow, John D. Rogers
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the pr…