Jump to content

Arithmetic circuit complexity: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

9 January 2025

26 July 2024

20 March 2024

8 December 2023

28 October 2023

  • curprev 09:2709:27, 28 October 2023 128.135.204.77 talk 13,339 bytes +333 Lower bounds: Fixed an error. Bezout’s lemma and Bezout’s theorem are very much different. (The original version says bezout’s lemma while Strassen and Baur actually used bezout’s theorem in their proof.) I added a reference for Strassen and Baur’s use of Bezout’s theorem (see Theorem 3.2 in the reference). If there’s anything wrong in the format, please help fix it. undo Tag: Visual edit: Switched

16 September 2023

8 February 2023

6 May 2022

17 June 2021

25 May 2021

24 May 2020

19 February 2019

9 December 2018

3 August 2018

20 April 2018

28 September 2017

16 October 2016

3 October 2016

7 July 2016

23 June 2016

20 February 2016

28 August 2015

12 October 2014

3 August 2014

2 August 2014

23 December 2013

15 November 2013

2 September 2013

19 July 2013

16 March 2013

16 January 2013

24 September 2012

7 September 2012

17 February 2011

24 December 2010

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)