Jump to content

Binary decision diagram: 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)

16 July 2024

15 April 2024

19 March 2024

3 February 2024

11 January 2024

23 December 2023

13 December 2023

28 November 2023

27 November 2023

22 November 2023

30 October 2023

12 October 2023

29 September 2023

23 July 2023

1 March 2023

29 January 2023

25 January 2023

11 January 2023

29 November 2022

9 October 2022

27 September 2022

3 August 2022

2 August 2022

1 July 2022

2 June 2022

1 June 2022

1 May 2022

25 March 2022

11 March 2022

12 February 2022

4 October 2021

  • curprev 22:0422:04, 4 October 2021V35b talk contribsm 20,448 bytes −13 "at the best and exponential at the worst case" -> "at best and exponential at worst" Alternate: "in the best case and exponential in the worst case" undo
  • curprev 21:5921:59, 4 October 2021V35b talk contribsm 20,461 bytes +3 "both by the function being represented and the chosen ordering of the variables" -> "by both the function being represented and the chosen ordering of the variables"] "Both" should refer to similar objects. In the original text it referred to a prepositional phrase and to the second element of the compound object of the phrase. The revision makes "both" refer to the elements of the compound object. Alternate: "both by the function being represented and by the chosen ordering of the variables" undo
  • curprev 17:5617:56, 4 October 2021Alexander Davronov talk contribs 20,458 bytes −37 No edit summary undo Tag: Visual edit

30 May 2021

10 April 2021

27 March 2021

13 March 2021

4 March 2021

3 March 2021

31 January 2021

30 January 2021

28 August 2020

2 July 2020

12 February 2020

  • curprev 10:2210:22, 12 February 2020132.229.130.83 talk 16,708 bytes +2 Rectified incorrect assertion that "L/poly captures the complexity of problems with polynomially sized BDDs". In fact, this class strictly contains the set of problems with polynomially sized BDDs. For example, the Hidden Weighted Bit function is in L/poly, but has not polynomially sized BDD undo

12 September 2019

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