151:
74:
53:
22:
1437:
By coincidence I have been trying to check the basis for the section 'Logical operations on BDDs'. I wanted to find references for including 'existential abstraction' and 'universal abstraction' in the list of operations that can be done by polynomial-time graph manipulation. Looking at ref. 16, the
435:
also from the same source it doesnt seem like the names are conflicting since there are diffrences in the graphs and the ROBDD can apparently be considered a specialization of the
Alternative Graph (havent seen Ubars paper but Raik has co-authered papers with Ubar since then so it would seem he got
172:
1186:
I removed the 404 and ones requesting contact by email to get program, others had like 32 downloads or were not even full releases. I kept the best looking ones and removed the tag. Its not really a problem I think. They are different and don't dwarf the article.
1171:
The policy states that at
Knowledge we don't allow collection of links as that may dwarf the page but this could be one of those borderline cases where the number of links might be high but each of them quite important from the article's perspective. Any
1462:
Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to
Restbase.") from server "http://localhost:6011/en.wikipedia.org/v1/":): {\displaystyle f(x_1,\ldots, x_8) = x_1x_2 + x_3x_4 + x_5x_6 +
1229:
In the field of computer science, a binary decision diagram (BDD) or branching program, like a negation normal form (NNF) or a propositional directed acyclic graph (PDAG), is a data structure that is used to represent a
Boolean
1273:
465:
for the official policy. Perhaps it is useful for one of the sister projects, such as wikisource. If someone disagrees and intends to put the implementation back into the article, please provide an argument before doing so.
1726:
package which also includes debug information. In particular, these values are their indices in the unique node table (fun fact). I have created a replacement by hand that also better aligns with the other figures.
1623:
F(x1,x2,x3,x4,x5,x6,x7,x8)Ā := (x1="1" & x2="1") | (x3="1" & x4="1") | (x5="1" & x6="1") | (x7="1" & x8="1");
497:
section could make good use of being expanded in a similar way (for example, showing the SatCount, Restrict, and Apply algorithms for the basics; maybe then also quantification for a more complex operations).
427:
I removed the above from the article, because (Ubar 1976) is not two years before (Lee 1959). Or does it mean before Akers??? I also don't understand the renaming thing. --Dirk 12:34, 1 September 2005 (UTC)
1234:
I don't understand why the lead is mentioning NNF and PDAG here. Yes, they are other representations of
Boolean functions, but there are many others. Why mention them at all? And why in the lead? --
1619:. The file pages for the diagrams contain helpful explanations for how the diagrams were generated, with RML/CrocoPath/GraphViz, and it appears that the function was incorrectly defined there as:
1201:
Some (like CMU, CAL and CUDD) are included for historical reasons but some others are actually used by people. I added back JDD and BuDDy and removed some others I felt could be left out instead.
416:
the sentence "For a long time, this representation was called
Alternative Graphs, until it was once renamed." needs fixing... either until it was renamed or until it was once again renamedĀ ???
196:
1274:
https://web.archive.org/web/20111101143950/http://myvideos.stanford.edu/player/slplayer.aspx?coll=ea60314a-53b3-4be2-8552-dcf190ca0c0b&co=18bcd3a8-965a-4a63-a516-a1ad74af1119&o=true
336:
500:
Certainly, the code that was removed back in 2009 may not have been the best way of doing so. But, I'd say that pseudo code would be beneficial to address a weakness of this article.
1617:
1540:
1277:
253:
191:
420:
Two years before Lee the same idea was introduced in former Soviet Union, in
Tallinn University of Technology (Ubar 1976). For a long time, this representation was called
1756:
124:
114:
1429:
1438:
Andersen paper, I don't see proper sourcing for any of the items in this section. So my proposal would be to delete the whole section, 'Logical operations on BDDs'.
1761:
1325:
1321:
1307:
90:
1751:
298:
1278:
http://myvideos.stanford.edu/player/slplayer.aspx?coll=ea60314a-53b3-4be2-8552-dcf190ca0c0b&co=18bcd3a8-965a-4a63-a516-a1ad74af1119&o=true
272:
137:
81:
58:
461:
I have moved the section "Implementation" here (see below). Knowledge is not a dumping ground for code, and not an implementation howto (see
361:
401:
1399:
1384:
244:
1689:
225:
490:
317:
431:
It means before Akers - Ubar from my understanding was the first to impose the sorted restriction on the tree (according to
1368:
282:
163:
33:
486:
292:
206:
1161:
327:
89:
related articles on
Knowledge. If you would like to participate, please visit the project page, where you can join
1415:
354:
1324:
to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the
1192:
405:
1693:
1403:
1388:
1359:
1265:
1257:
1434:
See 'existential abstraction' being defined in section 2.1. They speak as though they are coining the term.
1732:
1545:
1468:
1206:
505:
1666:
1643:
1343:
If you have discovered URLs which were erroneously considered dead by the bot, you can report them with
1331:
1177:
1157:
263:
39:
1264:. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit
1684:
1460:
In the section "Variable ordering", the shown diagrams do not correctly calculate the stated function
1443:
1298:
397:
21:
1662:
1639:
1188:
482:
1708:
1239:
462:
448:
437:
1328:
before doing mass systematic removals. This message is updated dynamically through the template
1344:
1423:
1153:
182:
1712:
1173:
471:
234:
86:
1681:
Seems there's an "improvement" on BDDs called SDDs, but wiki has no mention of these. FYI
1351:
1439:
443:
After some more searching it turns out that
Alternative Graphs eventually became known as
1728:
1310:, "External links modified" talk page sections are no longer generated or monitored by
1202:
501:
308:
150:
1350:
If you found an error with any archives or the URLs themselves, you can fix them with
173:
Requested articles/Applied arts and sciences/Computer science, computing, and
Internet
1745:
1235:
1736:
1716:
1697:
1670:
1653:
I see the source of my confusion. In Boolean logic theory it is common to use the
1647:
1447:
1407:
1392:
1373:
1243:
1210:
1196:
1181:
1165:
509:
475:
451:
447:
and the reason nobody new about Ubars work was because it was published in Rusion.
409:
1412:
Existential abstraction is mentioned in this 1999 paper by Edmund Clarke et al:
1317:
517:
467:
432:
1316:. No special action is required regarding these talk page notices, other than
394:"The resulting BDD is shown in the right figure." -- eh? What right figure?
215:
444:
73:
52:
1383:
I've never heard of them and I have some decent background in set theory.
1379:
What are the operations existential abstraction and universal abstraction?
1628:
The binary addition operators in the sum have been translated to boolean
1632:
operators, which is incorrect; binary addition is equivalent to boolean
520:. Declare the data structure as follows and then proceed accordingly.
493:, they do include some (pseudo) code to convey information. Here, the
1416:"Abstract BDDs: A Technique for Using Abstraction in Model Checking"
1685:
https://html.duckduckgo.com/html?q=Sentential%20Decision%20Diagrams
1152:
Should all of those links be removed? Seems like it goes against
440:(20 minutes before I learnt to insert four instead of 3 tilders)
291:
Find pictures for the biographies of computer scientists (see
15:
1722:
Indeed, it seems this picture is a DOT file from the python
1283:
When you have finished reviewing my changes, please set the
1268:
for additional information. I made the following changes:
1261:
1548:
1471:
85:, a collaborative effort to improve the coverage of
1320:using the archive tool instructions below. Editors
481:Looking at other articles on data structures, e.g.
1611:
1534:
1414:Edmund Clarke, Somesh Jha, Yuan Lu and Dong Wang.
197:Computer science articles needing expert attention
445:Structurally synthesized binary decision diagrams
1456:Problem with Variable ordering section diagram
1306:This message was posted before February 2018.
337:WikiProject Computer science/Unreferenced BLPs
8:
1707:The -11, -3, -5 on the nodes make no sense.
1428:: CS1 maint: multiple names: authors list (
1461:
254:Computer science articles without infoboxes
192:Computer science articles needing attention
1256:I have just modified one external link on
436:his information directly from the source)
158:Here are some tasks awaiting attention:
132:
47:
1547:
1470:
433:section 3.1 of Jaan Raik's masters thesis
1757:Mid-importance Computer science articles
516:This is a crude way to build a BDD in a
579:/* The interface to the Unique Table */
49:
19:
1421:
761:Data Structure for Building the ROBDD
99:Knowledge:WikiProject Computer science
1762:WikiProject Computer science articles
1295:to let others know (documentation at
102:Template:WikiProject Computer science
7:
1612:{\displaystyle f(1,1,1,1,0,0,0,0)=1}
1535:{\displaystyle f(1,1,1,1,0,0,0,0)=0}
79:This article is within the scope of
38:It is of interest to the following
273:Timeline of computing 2020āpresent
14:
1752:C-Class Computer science articles
1260:. Please take a moment to review
299:Computing articles needing images
491:Zero-suppressed_decision_diagram
149:
72:
51:
20:
119:This article has been rated as
1657:operator to stand for Boolean
1600:
1552:
1523:
1475:
525:/* The basic data structure */
424:, until it was once renamed.
1:
1542:, yet the diagrams both show
1244:22:56, 13 December 2013 (UTC)
353:Tag all relevant articles in
93:and see a list of open tasks.
1717:22:16, 1 November 2023 (UTC)
1677:Sentential Decision Diagrams
1671:22:31, 31 January 2019 (UTC)
1648:00:03, 31 January 2019 (UTC)
1374:19:32, 2 November 2016 (UTC)
1211:16:41, 5 February 2013 (UTC)
1166:22:55, 31 January 2012 (UTC)
362:WikiProject Computer science
138:WikiProject Computer science
82:WikiProject Computer science
1225:The lead currently begins:
487:Disjoint-set_data_structure
293:List of computer scientists
1778:
1737:09:10, 19 March 2024 (UTC)
1703:complemented edges diagram
1337:(last update: 5 June 2024)
1253:Hello fellow Wikipedians,
1182:18:19, 28 March 2012 (UTC)
495:Logical operations on BDDs
452:03:04, 17 April 2006 (UTC)
410:03:44, 30 April 2008 (UTC)
125:project's importance scale
1698:19:31, 14 June 2022 (UTC)
1661:, not addition modulo 2.
1448:04:38, 15 July 2017 (UTC)
1408:08:18, 14 July 2017 (UTC)
476:19:18, 16 June 2009 (UTC)
355:Category:Computer science
131:
118:
105:Computer science articles
67:
46:
1621:
1393:17:19, 3 July 2017 (UTC)
1197:05:50, 16 May 2012 (UTC)
763:
522:
357:and sub-categories with
1258:Binary decision diagram
1249:External links modified
510:07:26, 3 May 2024 (UTC)
1613:
1536:
318:Computer science stubs
28:This article is rated
1614:
1537:
1546:
1469:
1318:regular verification
136:Things you can help
1308:After February 2018
1287:parameter below to
1609:
1532:
1464:
1362:InternetArchiveBot
1313:InternetArchiveBot
422:Alternative Graphs
34:content assessment
1338:
412:
400:comment added by
392:
391:
388:
387:
384:
383:
380:
379:
376:
375:
1769:
1660:
1656:
1635:
1631:
1618:
1616:
1615:
1610:
1541:
1539:
1538:
1533:
1465:. For example,
1433:
1427:
1419:
1398:Anyone, please?
1372:
1363:
1336:
1335:
1314:
1302:
1158:LogicalFinance33
1142:
1139:
1136:
1133:
1130:
1127:
1124:
1121:
1118:
1115:
1112:
1109:
1106:
1103:
1100:
1097:
1094:
1091:
1088:
1085:
1082:
1079:
1076:
1073:
1070:
1067:
1064:
1061:
1058:
1055:
1052:
1049:
1046:
1043:
1040:
1037:
1034:
1031:
1028:
1025:
1022:
1019:
1016:
1013:
1010:
1007:
1004:
1001:
998:
995:
992:
989:
986:
983:
980:
977:
974:
971:
968:
965:
962:
959:
956:
953:
950:
947:
944:
941:
938:
935:
932:
929:
926:
923:
920:
917:
914:
911:
908:
905:
902:
899:
896:
893:
890:
887:
884:
881:
878:
875:
872:
869:
866:
863:
860:
857:
854:
851:
848:
845:
842:
839:
836:
833:
830:
827:
824:
821:
818:
815:
812:
809:
806:
803:
800:
797:
794:
791:
788:
785:
782:
779:
776:
773:
770:
767:
757:
754:
751:
748:
745:
742:
739:
736:
733:
730:
727:
724:
721:
718:
715:
712:
709:
706:
703:
700:
697:
694:
691:
688:
685:
682:
679:
676:
673:
670:
667:
664:
661:
658:
655:
652:
649:
646:
643:
640:
637:
634:
631:
628:
625:
622:
619:
616:
613:
610:
607:
604:
601:
598:
595:
592:
589:
586:
583:
580:
577:
574:
571:
568:
565:
562:
559:
556:
553:
550:
547:
544:
541:
538:
535:
532:
529:
526:
395:
366:
360:
235:Computer science
164:Article requests
153:
146:
145:
133:
107:
106:
103:
100:
97:
96:Computer science
87:Computer science
76:
69:
68:
63:
59:Computer science
55:
48:
31:
25:
24:
16:
1777:
1776:
1772:
1771:
1770:
1768:
1767:
1766:
1742:
1741:
1705:
1679:
1658:
1654:
1633:
1629:
1626:
1625:
1544:
1543:
1467:
1466:
1458:
1420:
1413:
1381:
1366:
1361:
1329:
1322:have permission
1312:
1296:
1266:this simple FaQ
1251:
1223:
1150:
1144:
1143:
1140:
1137:
1134:
1131:
1128:
1125:
1122:
1119:
1116:
1113:
1110:
1107:
1104:
1101:
1098:
1095:
1092:
1089:
1086:
1083:
1080:
1077:
1074:
1071:
1068:
1065:
1062:
1059:
1056:
1053:
1050:
1047:
1044:
1041:
1038:
1035:
1032:
1029:
1026:
1023:
1020:
1017:
1014:
1011:
1008:
1005:
1002:
999:
996:
993:
990:
987:
984:
981:
978:
975:
972:
969:
966:
963:
960:
957:
954:
951:
948:
945:
942:
939:
936:
933:
930:
927:
924:
921:
918:
915:
912:
909:
906:
903:
900:
897:
894:
891:
888:
885:
882:
879:
876:
873:
870:
867:
864:
861:
858:
855:
852:
849:
846:
843:
840:
837:
834:
831:
828:
825:
822:
819:
816:
813:
810:
807:
804:
801:
798:
795:
792:
789:
786:
783:
780:
777:
774:
771:
768:
765:
759:
758:
755:
752:
749:
746:
743:
740:
737:
734:
731:
728:
725:
722:
719:
716:
713:
710:
707:
704:
701:
698:
695:
692:
689:
686:
683:
680:
677:
674:
671:
668:
665:
662:
659:
656:
653:
650:
647:
644:
641:
638:
635:
632:
629:
626:
623:
620:
617:
614:
611:
608:
605:
602:
599:
596:
593:
590:
587:
584:
581:
578:
575:
572:
569:
566:
563:
560:
557:
554:
551:
548:
545:
542:
539:
536:
533:
530:
527:
524:
518:C like language
459:
425:
372:
369:
364:
358:
346:Project-related
341:
322:
303:
277:
258:
239:
220:
201:
177:
104:
101:
98:
95:
94:
61:
32:on Knowledge's
29:
12:
11:
5:
1775:
1773:
1765:
1764:
1759:
1754:
1744:
1743:
1740:
1739:
1704:
1701:
1678:
1675:
1674:
1673:
1622:
1608:
1605:
1602:
1599:
1596:
1593:
1590:
1587:
1584:
1581:
1578:
1575:
1572:
1569:
1566:
1563:
1560:
1557:
1554:
1551:
1531:
1528:
1525:
1522:
1519:
1516:
1513:
1510:
1507:
1504:
1501:
1498:
1495:
1492:
1489:
1486:
1483:
1480:
1477:
1474:
1457:
1454:
1453:
1452:
1451:
1450:
1435:
1380:
1377:
1356:
1355:
1348:
1281:
1280:
1272:Added archive
1250:
1247:
1232:
1231:
1222:
1219:
1218:
1217:
1216:
1215:
1214:
1213:
1189:ChrisGualtieri
1149:
1146:
1145:
764:
523:
514:
513:
512:
498:
483:Redāblack_tree
458:
457:Implementation
455:
419:
402:200.188.209.86
390:
389:
386:
385:
382:
381:
378:
377:
374:
373:
371:
370:
368:
367:
350:
342:
340:
339:
333:
323:
321:
320:
314:
304:
302:
301:
296:
288:
278:
276:
275:
269:
259:
257:
256:
250:
240:
238:
237:
231:
221:
219:
218:
212:
202:
200:
199:
194:
188:
178:
176:
175:
169:
157:
155:
154:
142:
141:
129:
128:
121:Mid-importance
117:
111:
110:
108:
91:the discussion
77:
65:
64:
62:Midāimportance
56:
44:
43:
37:
26:
13:
10:
9:
6:
4:
3:
2:
1774:
1763:
1760:
1758:
1755:
1753:
1750:
1749:
1747:
1738:
1734:
1730:
1725:
1721:
1720:
1719:
1718:
1714:
1710:
1702:
1700:
1699:
1695:
1691:
1687:
1686:
1682:
1676:
1672:
1668:
1664:
1652:
1651:
1650:
1649:
1645:
1641:
1637:
1620:
1606:
1603:
1597:
1594:
1591:
1588:
1585:
1582:
1579:
1576:
1573:
1570:
1567:
1564:
1561:
1558:
1555:
1549:
1529:
1526:
1520:
1517:
1514:
1511:
1508:
1505:
1502:
1499:
1496:
1493:
1490:
1487:
1484:
1481:
1478:
1472:
1455:
1449:
1445:
1441:
1436:
1431:
1425:
1417:
1411:
1410:
1409:
1405:
1401:
1400:185.24.86.101
1397:
1396:
1395:
1394:
1390:
1386:
1385:185.24.86.101
1378:
1376:
1375:
1370:
1365:
1364:
1353:
1349:
1346:
1342:
1341:
1340:
1333:
1327:
1323:
1319:
1315:
1309:
1304:
1300:
1294:
1290:
1286:
1279:
1275:
1271:
1270:
1269:
1267:
1263:
1259:
1254:
1248:
1246:
1245:
1241:
1237:
1228:
1227:
1226:
1220:
1212:
1208:
1204:
1200:
1199:
1198:
1194:
1190:
1185:
1184:
1183:
1179:
1175:
1170:
1169:
1168:
1167:
1163:
1159:
1155:
1147:
762:
521:
519:
511:
507:
503:
499:
496:
492:
488:
484:
480:
479:
478:
477:
473:
469:
464:
456:
454:
453:
450:
446:
441:
439:
434:
429:
423:
418:
417:
413:
411:
407:
403:
399:
363:
356:
352:
351:
349:
347:
343:
338:
335:
334:
332:
330:
329:
324:
319:
316:
315:
313:
311:
310:
305:
300:
297:
294:
290:
289:
287:
285:
284:
279:
274:
271:
270:
268:
266:
265:
260:
255:
252:
251:
249:
247:
246:
241:
236:
233:
232:
230:
228:
227:
222:
217:
214:
213:
211:
209:
208:
203:
198:
195:
193:
190:
189:
187:
185:
184:
179:
174:
171:
170:
168:
166:
165:
160:
159:
156:
152:
148:
147:
144:
143:
139:
135:
134:
130:
126:
122:
116:
113:
112:
109:
92:
88:
84:
83:
78:
75:
71:
70:
66:
60:
57:
54:
50:
45:
41:
35:
27:
23:
18:
17:
1723:
1706:
1690:79.79.253.53
1688:
1683:
1680:
1638:
1627:
1459:
1382:
1360:
1357:
1332:source check
1311:
1305:
1292:
1288:
1284:
1282:
1255:
1252:
1233:
1224:
1151:
760:
515:
494:
460:
442:
430:
426:
421:
415:
414:
393:
345:
344:
328:Unreferenced
326:
325:
307:
306:
281:
280:
262:
261:
243:
242:
224:
223:
205:
204:
181:
180:
162:
161:
120:
80:
40:WikiProjects
1299:Sourcecheck
1174:Wikishagnik
1024:robdd_build
961:robdd_build
775:robdd_build
463:WP:NOTHOWTO
396:āPreceding
1746:Categories
1440:EdJohnston
1369:Report bug
1154:WP:NOTLINK
1114:old_or_new
591:old_or_new
1729:Soelvsten
1352:this tool
1345:this tool
1230:function.
1203:Behandeem
1148:Ext links
502:Soelvsten
216:Computing
1663:User4096
1640:User4096
1424:cite web
1358:Cheers.ā
1236:Macrakis
1172:ideas?--
717:pointing
398:unsigned
264:Maintain
207:Copyedit
1463:x_7x_8}
1285:checked
1262:my edit
245:Infobox
183:Cleanup
123:on the
30:C-class
1709:Feydun
1293:failed
1111:return
1099:return
922:return
886:return
847:struct
826:vertex
823:struct
781:struct
769:vertex
766:struct
744:return
714:vertex
687:return
678:exists
648:vertex
612:vertex
609:struct
585:vertex
582:struct
552:vertex
549:struct
531:vertex
528:struct
489:, and
468:Hermel
449:Doctus
438:Doctus
226:Expand
36:scale.
1063:: -->
1057:</
1036:: -->
1000:: -->
994:</
973:: -->
904:equal
868:equal
805:: -->
799:</
793:: -->
705:<-
309:Stubs
283:Photo
140:with:
1733:talk
1713:talk
1694:talk
1667:talk
1644:talk
1444:talk
1430:link
1404:talk
1389:talk
1289:true
1240:talk
1221:Lead
1207:talk
1193:talk
1178:talk
1162:talk
1108:else
1060:math
1033:math
1030:<
997:math
970:math
967:<
931:else
895:else
850:char
802:math
790:math
787:<
784:expr
696:else
597:char
537:char
506:talk
472:talk
406:talk
1634:XOR
1326:RfC
1303:).
1291:or
1276:to
1156:.
916:'1'
880:'0'
811:int
711:new
115:Mid
1748::
1735:)
1724:dd
1715:)
1696:)
1669:)
1659:OR
1646:)
1636:.
1630:OR
1446:)
1426:}}
1422:{{
1406:)
1391:)
1339:.
1334:}}
1330:{{
1301:}}
1297:{{
1242:)
1209:)
1195:)
1180:)
1164:)
1135:);
1132:lo
1126:hi
1102:lo
1093:hi
1090:==
1087:lo
1081:if
1078:);
1045:xi
1018:lo
1015:);
982:xi
955:hi
952:);
925:v1
919:))
898:if
889:v0
883:))
862:if
841:lo
832:hi
741:);
738:lo
732:hi
720:at
672:lo
666:hi
636:if
627:lo
618:hi
573:..
567:lo
558:hi
508:)
485:,
474:)
408:)
365:}}
359:{{
1731:(
1711:(
1692:(
1665:(
1655:+
1642:(
1607:1
1604:=
1601:)
1598:0
1595:,
1592:0
1589:,
1586:0
1583:,
1580:0
1577:,
1574:1
1571:,
1568:1
1565:,
1562:1
1559:,
1556:1
1553:(
1550:f
1530:0
1527:=
1524:)
1521:0
1518:,
1515:0
1512:,
1509:0
1506:,
1503:0
1500:,
1497:1
1494:,
1491:1
1488:,
1485:1
1482:,
1479:1
1476:(
1473:f
1442:(
1432:)
1418:.
1402:(
1387:(
1371:)
1367:(
1354:.
1347:.
1238:(
1205:(
1191:(
1176:(
1160:(
1141:}
1138:}
1129:,
1123:,
1120:Ļ
1117:(
1105:;
1096:)
1084:(
1075:1
1072:+
1069:i
1066:,
1054:)
1051:0
1048:=
1042:(
1039:f
1027:(
1021:ā
1012:1
1009:+
1006:i
1003:,
991:)
988:1
985:=
979:(
976:f
964:(
958:ā
949:i
946:(
943:Šæ
940:ā
937:Ļ
934:{
928:;
913:,
910:f
907:(
901:(
892:;
877:,
874:f
871:(
865:(
859:;
856:Ļ
853:*
844:;
838:*
835:,
829:*
820:{
817:)
814:i
808:,
796:f
778:(
772:*
756:}
753:}
750:;
747:v
735:,
729:,
726:Ļ
723:(
708:ā
702:v
699:{
693:;
690:v
684:)
681:ā
675:)
669:,
663:,
660:Ļ
657:(
654:=
651:v
645:a
642:ā
639:(
633:{
630:)
624:*
621:,
615:*
606:,
603:Ļ
600:*
594:(
588:*
576:}
570:;
564:*
561:,
555:*
546:;
543:Ļ
540:*
534:{
504:(
470:(
404:(
348::
331::
312::
295:)
286::
267::
248::
229::
210::
186::
167::
127:.
42::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
