Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
seminars [2026-09-12] – [Introduction to OSCAR] Martin Zieglerseminars [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====
-  * September 18, 15h30 KST+  * September 23, 10am KST
   * N1 #422    * N1 #422 
   * Sehun Park (KAIST)   * Sehun Park (KAIST)
  
- +The bit-cost of processing (say, continuous) real functions is exponentially more expensive than of single real numbers, but parallelizes well using Prefix Sum. 
 +We introduce the open-source computer algebra system OSCAR and our first programming steps in Julia, including examples including Prefix Sum.
 ====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