Zobrazeno 1 - 10
of 243
pro vyhledávání: '"Spakowski, A."'
Ten years ago, Gla{\ss}er, Pavan, Selman, and Zhang [GPSZ08] proved that if P $\neq$ NP, then all NP-complete sets can be simply split into two NP-complete sets. That advance might naturally make one wonder about a quite different potential consequen
Externí odkaz:
http://arxiv.org/abs/1807.10983
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 impossible to improve this from polynomially many gap values to a superpolynomi
Externí odkaz:
http://arxiv.org/abs/1711.01250
Autor:
Spakowski, Nicola
Publikováno v:
Femina Politica - Zeitschrift für feministische Politikwissenschaft, 31, 1, 104-108
Externí odkaz:
https://www.ssoar.info/ssoar/handle/document/81057
Autor:
Spakowski, Nicola, author
Publikováno v:
Soldatinnen: Gewalt und Geschlecht im Krieg vom Mittelalter bis heute. :207-231
Autor:
Spakowski, Nicola, author
Publikováno v:
Formen des Krieges: Von der Antike bis zur Gegenwart. :355-369
Autor:
Spakowski, Nicola
Publikováno v:
Modern China, 2019 Jan 01. 45(1), 91-122.
Externí odkaz:
https://www.jstor.org/stable/26588759
Autor:
Spakowski, Nicola, author
Publikováno v:
Historical Truth, Historical Criticism, and Ideology: Chinese Historiography and Historical Culture from a New Comparative Perspective. :465-481
We prove that every distributional problem solvable in polynomial time on the average with respect to the uniform distribution has a frequently self-knowingly correct polynomial-time algorithm. We also study some features of probability weight of cor
Externí odkaz:
http://arxiv.org/abs/0806.2555
We investigate issues related to two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Christian et al. [CFRS06] showed that optimal lobbying is intractable in t
Externí odkaz:
http://arxiv.org/abs/cs/0703097
Autor:
Spakowski, Holger, Tripathi, Rahul
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs involving
Externí odkaz:
http://arxiv.org/abs/cs/0702047