Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

First Page		Document Content
Date: 2014-04-12 08:04:57 Theoretical computer science Lance Fortnow Probabilistic complexity theory Carsten Lund Computer science IP BPP Probabilistically checkable proof Symposium on Foundations of Computer Science Mathematics		Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 94,00 KB Share Document on Facebook

	A Story of Parametric Trace Slicing, Garbage and Static Analysis Giles Reger School of Computer Science, University of Manchester, UK PrePost 2017 DocID: 1xW3e - View Document
	Poster: Android Collusive Data Leaks with Flow-sensitive DIALDroid Dataset Amiangshu Bosu Fang Liu, Danfeng (Daphne) Yao, Gang Wang Department of Computer Science DocID: 1xW0O - View Document
	Reachability Analysis of Deep Neural Networks with Provable Guarantees Wenjie Ruan1 , Xiaowei Huang2 , Marta Kwiatkowska1 Department of Computer Science, University of Oxford, UK 2 Department of Computer Science, Univers DocID: 1xW0E - View Document
	The Theory and Practice of Causal Commutative Arrows Hai (Paul) Liu Advisor: Paul Hudak Computer Science Department Yale University DocID: 1xVYc - View Document
	Static Program Analysis for Identifying Energy Bugs in Graphics-Intensive Mobile Apps Chang Hwan Peter Kim, Daniel Kroening, and Marta Kwiatkowska Department of Computer Science, University of Oxford, UK DocID: 1xVY6 - View Document