Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| seminars [2026-09-15] – [Introduction to OSCAR] Martin Ziegler | seminars [2026-09-29] (current) – [2026] Martin Ziegler | ||
|---|---|---|---|
| Line 15: | Line 15: | ||
| ===== 2026 ===== | ===== 2026 ===== | ||
| + | |||
| + | ====NP-Completeness Proofs of Pencil Puzzles==== | ||
| + | * September 29, 10h30am KST | ||
| + | * N1 #111 | ||
| + | * Suthee Ruangwises (Chulalongkorn University) | ||
| + | |||
| ====Introduction to OSCAR==== | ====Introduction to OSCAR==== | ||
| Line 21: | Line 27: | ||
| * Sehun Park (KAIST) | * Sehun Park (KAIST) | ||
| - | Currently Real computation become the important topic on various field. To solve part of the problem | + | The bit-cost |
| + | We introduce | ||
| ====Extensions of the skein algorithm for link polynomials 2==== | ====Extensions of the skein algorithm for link polynomials 2==== | ||
| * March 10, 9h KST | * March 10, 9h KST | ||