Efficient Secure Computation Optimization Raphael Urmoneit Florian Kerschbaum Technische Universität

First Page		Document Content
Date: 2013-08-28 05:10:42 Complexity classes Theoretical computer science Computational resources Mathematical logic Computability theory Algorithm Recursion NP DSPACE FO Exponential time hypothesis Time complexity		Efficient Secure Computation Optimization Raphael Urmoneit Florian Kerschbaum Technische Universität Add to Reading List Source URL: www.fkerschbaum.org Download Document from Source Website File Size: 160,18 KB Share Document on Facebook

	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk DocID: 1qorC - View Document
	Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki DocID: 1qjxp - View Document
	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 DocID: 1q2Qr - View Document
	Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1 DocID: 1pX17 - View Document
	ORANGE BOXES = CNF & PARADIM REU MANDATORY EVENTS DARK GREEN = MANDATORY CNF REU ACTIVITIES • R E U • C A L E N D A R • Sunday Monday DocID: 1pQTs - View Document