Exponential time hypothesis

Results: 28



#Item
1Parameterized 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

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

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2009-11-10 10:56:36
2Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1  Instytut Informatyki

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

Add to Reading List

Source URL: rutcor.rutgers.edu

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

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

Add to Reading List

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

Language: English - Date: 2016-01-03 06:44:56
4Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

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

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-11-09 10:22:02
5ORANGE 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

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

Add to Reading List

Source URL: www.cnf.cornell.edu

Language: English - Date: 2016-07-07 09:39:43
    6Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith  J. Christopher Beck

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

    Add to Reading List

    Source URL: www.haz.ca

    Language: English - Date: 2013-10-28 07:18:32
    7Algorithms 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.

    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.

    Add to Reading List

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

    Language: English - Date: 2016-03-01 06:02:55
    8On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2

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

    Add to Reading List

    Source URL: www.mancoosi.org

    Language: English - Date: 2012-12-16 04:54:55
    9Efficient Secure Computation Optimization Raphael Urmoneit Florian Kerschbaum  Technische Universität

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

    Add to Reading List

    Source URL: www.fkerschbaum.org

    Language: English - Date: 2013-08-28 05:10:42
    10Differentially 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

    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

    Add to Reading List

    Source URL: tpdp16.cse.buffalo.edu

    Language: English - Date: 2016-06-08 10:11:54