Nobutaka Shimizu

0 Followers

5 SlideShares 2 Folgens

5 SlideShares 2 Folgens

voting process pcp theorem error-collecting code computational complexity dynamic graph random walk average-case complexity

Aktivität
Info

Quasi-Majority Functional Voting on Expander Graphs

Vor 3 Jahren • 42 Aufrufe

Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models

Vor 3 Jahren • 44 Aufrufe

Nearly optimal average case complexity of counting bicliques under seth

Vor 3 Jahren • 71 Aufrufe

How many vertices does a random walk miss in a network with moderately increasing the number of vertices?

Vor 3 Jahren • 46 Aufrufe

Introduction to Locally Testable Codes and Related Topics (in Japanese)

Vor 2 Jahren • 248 Aufrufe

見やすいプレゼン資料の作り方 - リニューアル増量版

MOCKS | Yuta Morishige • Vor 9 Jahren

voting process pcp theorem error-collecting code computational complexity dynamic graph random walk average-case complexity