20 citations · 206 across the 49 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski +1
We show that the counting class LWPP [FFK94] remains unchanged even if one allows a polynomial number of gap values rather than one. On the other hand, we show that it is impossibl…
cs.CC2017
Credimus
Edith Hemaspaandra, Lane A. Hemaspaandra
We believe that economic design and computational complexity---while already important to each other---should become even more important to each other with each passing year. But f…