Nobutaka Shimizu

0 Followers

5 SlideShares 2 Followings

5 SlideShares 2 Followings

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

See more

Activity
About

Quasi-Majority Functional Voting on Expander Graphs

4 years ago • 51 Views

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

4 years ago • 51 Views

Nearly optimal average case complexity of counting bicliques under seth

4 years ago • 75 Views

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

4 years ago • 49 Views

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

3 years ago • 265 Views

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

MOCKS | Yuta Morishige • 10 years ago

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

See more