-
Algorithms for general SAT
Speaker: Jian Ma(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 15:00-17:00 (Time in Auckland) November 5, 2021 (Friday) Venue: Qingshuihe Campus Abstract: The CNF satisfiability problem is defined as follows: given a CNF formula , decide if there exists truth-value assignment to variables such that the formula evaluates to true. […]
-
The security issues in diffusion Auction
Speaker: Yuchao Song (master student in University of Electronic Science and Technology of China) Time: 10:00-11:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) November 26, 2021 (Friday) Venue: B1-518B, Research Building 4 Abstract: With a rapid growth of social networks, promoting products through social networks has become a challenging and important problem for stakeholders. During […]
-
On the reals weakly low for K
Speaker: Liang Yu(professor in Nanjing University) Time: 15:00-16:00 (Time in Beijing) 20:00-21:00 (Time in Auckland) November 01, 2021 (Monday) Venue: B1-518B, Research Building 4 Abstract: Given an infinite set , real is called weakly low for on if there are infinitely many so that does not improve the prefix-free complexity of up to a constant. […]
-
Quasi-Isometric Graph-Simplifications
Speaker: Roger Su(University of Auckland) Time: 10:00-12:00 (Time in Beijing) 15:00-17:00 (Time in Auckland) October 29, 2021 (Friday) Venue: Qingshuihe Campus Abstract: Quasi-isometries are a concept originally used to study infinite algebraic objects. Here we apply quasi-isometries to finite graphs, and propose a theoretical framework for simplifying large-scale graphs. This framework consists of several goals, […]
-
Subset Feedback Vertex Set in Chordal Graph
Speaker: Tian Bai(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) October 15, 2021 (Friday) Venue: Qingshuihe Campus Abstract: The Subset Feedback Vertex Set (SFVS) problem takes as input a graph and a subset of vertices in . The task is to find a minimal set of […]
-
Randomness and Complexity
Speaker: Cristian Calude(professor in University of Auckland) Time: 14:00-15:00 (Time in Beijing) 18:00-19:00 (Time in Auckland) October 11, 2021 (Monday) Venue: Zoom Meeting ID: 711 8843 8437 Password: 202101 Abstract: Since ancient times randomness had been viewed as an obstacle and difficulty. This attitude has changed in the last century when randomness became central to […]
-
Rapid mixing of Glauber dynamics via spectral independence for all degrees
Speaker: Weiming Feng(research associate in University of Edinburgh) Time: 11:00-12:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) September 17, 2021 (Friday) Venue: B1-518B, Research Building 4 Abstract: We prove an optimal lower bound on spectral gap of the Glauber dynamics for anti-ferromagnetic two-spin systems with vertices in the tree uniqueness regime. This spectral gap holds […]
-
On 1-2-3 Conjecture
Speaker: Xuding Zhu(Zhejiang Normal University) Host: Shanghai Center For Mathematical Science Time: 14:00 – 16:00 (Time in Beijing) September 13, 2021 (Monday) Venue: Zoom meeting ID: 818 0564 1942 Password: 121323 Link: https://zoom.com.cn/j/81805641942 Abstract: The well-known 1-2-3 conjecture asserts that any graph with no isolated edges has an edge-weighting vertex colouring using weights 1,2 and […]
-
Approximation Algorithms for TTP-3
Speaker: Jingyang Zhao(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) September 10, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/dm/xKZlIrcZhk0Z ID: 704 420 285 Venue: Qingshuihe Campus Abstract: The Traveling Tournament Problem is a complex combinatorial optimization problem in tournament timetabling, which asks us to design a double round-robin […]
-
Heuristic Algorithms for Steiner Tree Problem
Speaker: Xinyu Wu (University of Electronic and Science Technology of China) Time: 10:00-11:00 (Time in Beijing) 14:00-15:00 (Time in Auckland) September 3, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/dm/WlulUnrGJ0NM?rs=25 ID: 969 615 091 Venue: Qingshuihe Campus Abstract: The Steiner tree problem (STP) is a challenging NP-hard problem that commonly arises in practical applications as one of many […]