Arithmetic circuit complexity

Results: 18



#Item
1Online Learning for Time Series Prediction Elad Hazan Shie Mannor  Ohad Shamir

Online Learning for Time Series Prediction Elad Hazan Shie Mannor Ohad Shamir

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-02-27 20:17:13
2On 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

Add to Reading List

Source URL: www.math.ru.nl

Language: English - Date: 2014-10-29 10:35:56
3Journal 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

Add to Reading List

Source URL: math.mit.edu

Language: English - Date: 2011-03-23 10:26:18
4Arithmetic 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

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2011-03-10 13:51:53
5Faster 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

Add to Reading List

Source URL: web.maths.unsw.edu.au

Language: English - Date: 2014-12-30 21:41:38
6

PDF Document

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2013-01-31 23:01:51
7On 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‡

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 05:20:19
8Lower 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

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2015-01-31 16:25:52
9Lower 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

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2015-02-05 11:02:38