New bounds for information complexity and quantum query complexity

In this paper, we consider (temporally ordered) data represented in Description Logics from the popular DL- Lite family and Temporal Query Language, based on the combination of LTL

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Our main result is that the query complexity of finding a subgroup hidden in G is of order r(G) for any Abelian group G, where r(G) denotes the rank of G, that is, the

In particular if a norm is computable in polynomial time then its set of relevant points has Hausdorff dimension 0 (Theorem 3.4 ), almost every point has a polynomial

Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an

The first is a hierarchy the- orem, stating that the polynomial hierarchy of alternating online state complexity is infinite, and the second is a linear lower bound on the

Since the multiplicative adversary method can prove lower bounds for small success probability, Špalek has been able to prove that the bound obtained with this method obeys a

For every p-pass Shellsort algorithm and every increment sequence, every subset of n!/2 n input permutations of n keys contains an input permutation that uses ⍀ ( pn 1⫹(1⫺⑀)/p