Owlstown Text-Only

Nadezhda Voronova

Nadya Voronova
Go to full site
Home
Publications
CV
Other

Poster on approximate degree of OIP


Paper

Poster itself

References

  • [BdW99] Harry Buhrman and Ronald de Wolf. A lower bound for quantum search of an ordered list.
  • [She12] Alexander A Sherstov. Making polynomials robust to noise.
  • [CIG+12] Richard Cleve, Kazuo Iwama, Fran¸cois Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, and Shigeru Yamashita. Reconstructing strings from substrings with quantum queries.
  • See more in the paper


Contact


Nadezhda Voronova (she/her)

Preferred name: Nadya



Computer Science

Boston University


Curriculum vitae


LinkedIn


© 2025 Nadezhda Voronova
  ·  Privacy Policy

Made in Owlstown