1![Online Learning for Time Series Prediction Elad Hazan Shie Mannor Ohad Shamir Online Learning for Time Series Prediction Elad Hazan Shie Mannor Ohad Shamir](https://www.pdfsearch.io/img/89c061491446aba02f3bab16346e9f7c.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2013-02-27 20:17:13
|
---|
2![On Cobham’s theorem for Gaussian integers Wieb Bosma∗, Robbert Fokkink, and Thijmen Krebs † June 2014 On Cobham’s theorem for Gaussian integers Wieb Bosma∗, Robbert Fokkink, and Thijmen Krebs † June 2014](https://www.pdfsearch.io/img/d95497e1d0485a89be77095b2bcb2f90.jpg) | Add to Reading ListSource URL: www.math.ru.nlLanguage: English - Date: 2014-10-29 10:35:56
|
---|
3![Journal of Computer and System Sciences–737 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss Journal of Computer and System Sciences–737 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss](https://www.pdfsearch.io/img/9a1511e7a142d44760efaf4c2f71521d.jpg) | Add to Reading ListSource URL: math.mit.eduLanguage: English - Date: 2011-03-23 10:26:18
|
---|
4![Arithmetic Circuits: a survey of recent results and open questions Amir Shpilka 1 Arithmetic Circuits: a survey of recent results and open questions Amir Shpilka 1](https://www.pdfsearch.io/img/542edf7b4fc803890f1170b951246092.jpg) | Add to Reading ListSource URL: www.cs.technion.ac.ilLanguage: English - Date: 2011-03-10 13:51:53
|
---|
5![Faster polynomial multiplication over finite fields David Harvey University of New South Wales 8th December AustMS/NZMS 2014, University of Melbourne Faster polynomial multiplication over finite fields David Harvey University of New South Wales 8th December AustMS/NZMS 2014, University of Melbourne](https://www.pdfsearch.io/img/a37cf972f04a113f863d35d0218d7937.jpg) | Add to Reading ListSource URL: web.maths.unsw.edu.auLanguage: English - Date: 2014-12-30 21:41:38
|
---|
6![](https://www.pdfsearch.io/img/b44591adb3c07d8dad9043bfd2cad996.jpg) | Add to Reading ListSource URL: fpt.wdfiles.comLanguage: English - Date: 2013-01-31 23:01:51
|
---|
7![On the Expected Depth of Random Circuits Sunil Arya∗ Mordecai J. Golin† Kurt Mehlhorn‡ On the Expected Depth of Random Circuits Sunil Arya∗ Mordecai J. Golin† Kurt Mehlhorn‡](https://www.pdfsearch.io/img/a9cb65a9701709ed945b96b7689ff3bb.jpg) | Add to Reading ListSource URL: www.cse.ust.hkLanguage: English - Date: 2006-04-04 05:20:19
|
---|
8![Lower Bounds for Monotone Counting Circuits Stasys Jukna1,2 Institute of Computer Science, Goethe University, Frankfurt am Main, Germany Abstract A {+, ×}-circuit counts a given multivariate polynomial f , if its values Lower Bounds for Monotone Counting Circuits Stasys Jukna1,2 Institute of Computer Science, Goethe University, Frankfurt am Main, Germany Abstract A {+, ×}-circuit counts a given multivariate polynomial f , if its values](https://www.pdfsearch.io/img/2a4f2f86234c2ce0960bf2888d1620cd.jpg) | Add to Reading ListSource URL: lovelace.thi.informatik.uni-frankfurt.deLanguage: English - Date: 2015-01-31 16:25:52
|
---|
9![Lower Bounds for Tropical Circuits and Dynamic Programs∗ Stasys Jukna University of Frankfurt, Institute of Computer Science, Germany Vilnius University, Institute of Mathematics and Informatics, Vilnius, Lithuania juk Lower Bounds for Tropical Circuits and Dynamic Programs∗ Stasys Jukna University of Frankfurt, Institute of Computer Science, Germany Vilnius University, Institute of Mathematics and Informatics, Vilnius, Lithuania juk](https://www.pdfsearch.io/img/998fd350dc57dfae5228f42e96004feb.jpg) | Add to Reading ListSource URL: lovelace.thi.informatik.uni-frankfurt.deLanguage: English - Date: 2015-02-05 11:02:38
|
---|