Timeline for Build a 4-vertex Connectedness Tester using NAND gates
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jan 25, 2016 at 5:35 | history | undeleted | lirtosiast | ||
| Jan 25, 2016 at 5:35 | history | edited | lirtosiast | CC BY-SA 3.0 |
added 97 characters in body
|
| Jan 23, 2016 at 5:27 | history | deleted | lirtosiast | via Vote | |
| Jan 23, 2016 at 5:10 | comment | added | lirtosiast | @RickyDemer I think this works now... | |
| Jan 23, 2016 at 5:10 | history | undeleted | lirtosiast | ||
| Jan 23, 2016 at 5:10 | history | edited | lirtosiast | CC BY-SA 3.0 |
Fixed
|
| Jan 23, 2016 at 5:06 | history | deleted | lirtosiast | via Vote | |
| Jan 23, 2016 at 5:04 | comment | added | user30594 | [True,True,False,True,False,False] gives a connected graph without any opposite edges. | |
| Jan 23, 2016 at 5:01 | history | answered | lirtosiast | CC BY-SA 3.0 |