University of Latvia

output

19972026

most citedTemperature and magnetic field dependent longitudinal spin relaxation in nitrogen-vacancy ensembles in diamond

419 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2014 · cs.CCShow all

5 papers · 2 filters

cs.CC2014★ 27 cited

Fast Matrix Multiplication: Limitations of the Laser Method

Andris Ambainis, Yuval Filmus, François Le Gall

Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time $O (n^{2.3755})$ . Recently, a surge of activity by Stot…

cs.CC2014

Tighter Relations Between Sensitivity and Other Complexity Measures

Andris Ambainis, Mohammad Bavarian, Yihan Gao +3

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulate…

cs.CC2014★ 3 cited

Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma

Andris Ambainis, Jevgēnijs Vihrovs

We study the structure of sets $S \subseteq {0, 1}^{n}$ with small sensitivity. The well-known Simon's lemma says that any $S \subseteq {0, 1}^{n}$ of sensitivity $s$ must be of size a…

cs.CC2014★ 3 cited

Exact quantum algorithms have advantage for almost all Boolean functions

Andris Ambainis, Jozef Gruska, Shenggen Zheng

It has been proved that almost all $n$ -bit Boolean functions have exact classical query complexity $n$ . However, the situation seemed to be very different when we deal with exact q…

cs.CC2014★ 5 cited

A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity

Andris Ambainis, Krišjānis Prūsis

Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy, is wheth…