@InProceedings{chen:LIPIcs.CCC.2018.14,
  author =	{Chen, Lijie},
  title =	{{On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product}},
  booktitle =	{33rd Computational Complexity Conference (CCC 2018)},
  pages =	{14:1--14:45},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-069-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{102},
  editor =	{Servedio, Rocco A.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.14},
  URN =		{urn:nbn:de:0030-drops-88752},
  doi =		{10.4230/LIPIcs.CCC.2018.14},
  annote =	{Keywords: Maximum Inner Product, SETH, Hardness of Approximation in P, Fined-Grained Complexity, Hopcroft's Problem, Chinese Remainder Theorem}
}