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

Source URL: www.bedewell.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• NP-complete problems
• Complexity classes
• Logic in computer science
• Finite model theory
• Parameterized complexity
• Resolution
• Exponential time hypothesis
• Boolean satisfiability problem
• Conjunctive normal form

Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki

Source URL: rutcor.rutgers.edu

• Computational complexity theory
• Theory of computation
• Analysis of algorithms
• Order theory
• Parameterized complexity
• NP
• Exponential time hypothesis
• Randomized algorithm
• Time complexity
• Partially ordered set
• Order dimension

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Approximation algorithms
• Computational hardness assumptions
• Polynomial-time approximation scheme
• Time complexity
• NC
• Reduction
• Exponential time hypothesis
• NP-hardness
• NP

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Source URL: drops.dagstuhl.de

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Constraint programming
• NP-complete problems
• Boolean algebra
• Parameterized complexity
• Boolean satisfiability problem
• Constraint satisfaction problem
• Exponential time hypothesis
• Treewidth
• Tree decomposition

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

Source URL: www.cnf.cornell.edu

Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck

Source URL: www.haz.ca

• Theoretical computer science
• Mathematics
• Formal methods
• Constraint programming
• Boolean algebra
• Automated theorem proving
• DPLL algorithm
• Binary decision diagram
• Exponential time hypothesis
• Computational complexity theory
• Bayesian network
• Distribution

Algorithms and Data Structures Winter TermExercises for Unit 4 1. Consider the problem Disjointness of testing whether two sets A = {a1 , . . . , an } and B = {b1 , . . . , bn } of real numbers are disjoint.

Source URL: www-tcs.cs.uni-sb.de

• Disjoint sets
• Sine
• Exponential time hypothesis
• Pi

On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2

Source URL: www.mancoosi.org

• Automated theorem proving
• Logic in computer science
• Propositional calculus
• Unsatisfiable core
• Boolean algebra
• Resolution
• Exponential time hypothesis
• Algorithm
• Maximum satisfiability problem
• Boolean satisfiability problem
• DavisPutnam algorithm

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

Source URL: www.fkerschbaum.org

• Complexity classes
• Theoretical computer science
• Computational resources
• Mathematical logic
• Computability theory
• Algorithm
• Recursion
• NP
• DSPACE
• FO
• Exponential time hypothesis
• Time complexity

Differentially Private Integer Partitions and their Applications Jeremiah Blocki Microsoft Research Abstract Given a positive integer N ≥ 0 a partition of N is a non-increasing sequence of numbers x1 ≥ x2 . . . ≥ x

Source URL: tpdp16.cse.buffalo.edu

• Information privacy
• Exponentials
• Analysis of algorithms
• Applied probability
• Exponential mechanism
• Differential privacy
• Time complexity
• Password
• Exponential time hypothesis
• Partition
• Algorithm
• Exponential function