On Basing One-Way Functions on NP-Hardness Adi Akavia Oded Goldreich MIT

Source URL: people.csail.mit.edu

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

Source URL: disco.ethz.ch

• Computational complexity theory
• Complexity classes
• NP-complete problems
• Operations research
• Combinatorial optimization
• Mathematical optimization
• Knapsack problem
• Reduction
• Graph coloring
• NP-hardness
• NP
• Optimization problem

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

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

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Packing problems
• Operations research
• Approximation algorithms
• Knapsack problem
• Vertex cover
• Bin packing problem
• Hardness of approximation
• Algorithm

On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira

Source URL: www.dcg.ethz.ch

• Theory of computation
• Complexity classes
• Mathematics
• Theoretical computer science
• Valuation
• Submodular set function
• NC
• NP
• Reduction
• P/poly

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

Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes

Source URL: pagesperso.lina.univ-nantes.fr

• Computational problems
• NP-complete problems
• Optimization problem
• Synteny
• Independent set

What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2

Source URL: pagesperso.lina.univ-nantes.fr

• Complexity classes
• NP-hardness
• NP
• P versus NP problem
• Computational complexity theory
• P
• Reduction

QCSP on partially reflexive forests Barnaby Martin Algorithms and Complexity in Durham, Durham University, U.K. CP 2011, Perugia. 14th August 2011.

Source URL: www.bedewell.com

• Complexity classes
• NP-hardness
• IP
• PSPACE-complete
• NP
• Reduction
• PSPACE
• P
• FO
• Circuits over sets of natural numbers
• True quantified Boolean formula

Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125.

Source URL: users.cms.caltech.edu

• Complexity classes
• Computational complexity theory
• Advice
• PP
• P/poly
• ArthurMerlin protocol
• Pseudorandom generator
• Randomized algorithm
• NP
• IP
• Extractor
• ACC0

RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering

Source URL: grk1855.tu-dortmund.de

• Computational complexity theory
• Theory of computation
• Combinatorial optimization
• Complexity classes
• Operations research
• Integer programming
• Heuristic
• Branch and bound
• NP
• Optimization problem
• Pruning
• Reduction