[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Perfect matchings in o( n log n ) time in regular bipartite graphs

The file will be sent to your email address. It may take up to 1-5 minutes before you receive it.

The file will be sent to you via the Telegram messenger. It may take up to 1-5 minutes before you receive it.

Note: Make sure you have linked your account to Z-Library Telegram bot.

The file will be sent to your Kindle account. It may take up to 1–5 minutes before you receive it.

Please note: you need to verify every book you want to send to your Kindle. Check your mailbox for the verification email from Amazon Kindle.