We show that equivalence of central extensions can be computed
Efficiently on a classical computer when the groups are small enough to be
Given by their multiplication tables. However, in the model of black box
Groups, which allows the groups to be much larger, we show that equivalence can
We introduce approximation algorithms and strong NP-completeness results for
Interdiction problems on planar graphs. Interdiction problems are
Leader-follower games in which the leader is allowed to delete a certain number
Of edges from the graph in order to maximally impede the follower, who is
We present a new method for solving the hidden polynomial graph problem
(HPGP) which is a special case of the hidden polynomial problem (HPP). The new
Approach yields an efficient quantum algorithm for the bivariate HPGP even when
The input consists of several level set superpositions, a more diffic...
Pubget Updates sends you emails when Pubget finds new papers that match your search. Use Pubget Updates to get the latest articles for your specialty, written by a colleague, or published by your favorite journals.