<--- Back to Details
First PageDocument Content
Complexity classes / Distributed computing / NP / Computational complexity theory / P / NC
Date: 2016-01-06 03:53:49
Complexity classes
Distributed computing
NP
Computational complexity theory
P
NC

Local Checkability, No Strings Attached Klaus-Tycho Förster, Thomas Lüdi, Jochen Seidel, Roger Wattenhofer January 06, 2016 @ ICDCNSingapore ETH Zurich – Distributed Computing – www.disco.ethz.ch

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Download Document from Source Website

File Size: 1,31 MB

Share Document on Facebook

Similar Documents

Distributed Computing Prof. R. Wattenhofer BA/MA/SA:  A Hybrid Blockchain System

Distributed Computing Prof. R. Wattenhofer BA/MA/SA: A Hybrid Blockchain System

DocID: 1xVNV - View Document

Distributed Computing Prof. R. Wattenhofer SA/MA:  Byzantine Reinforcement Learning

Distributed Computing Prof. R. Wattenhofer SA/MA: Byzantine Reinforcement Learning

DocID: 1xVKs - View Document

Distributed Computing Prof. R. Wattenhofer Activity Recognition and Adversarial Learning with Smartwatches

Distributed Computing Prof. R. Wattenhofer Activity Recognition and Adversarial Learning with Smartwatches

DocID: 1xVFo - View Document

Distributed Computing Prof. R. Wattenhofer BA/SA/Group/Lab:  Dynamic Directories

Distributed Computing Prof. R. Wattenhofer BA/SA/Group/Lab: Dynamic Directories

DocID: 1xVCB - View Document

Distributed Computing Prof. R. Wattenhofer Advanced Topics in Deep Learning - Disentangled Representations

Distributed Computing Prof. R. Wattenhofer Advanced Topics in Deep Learning - Disentangled Representations

DocID: 1xVwm - View Document