„Time Complexity“

Suchergebnisse

1.161 Treffer

• The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
  Chen, Rubing ; Yuan, Jinjiang ; Gao, Yuan
• The single-processor scheduling problem with time restrictions: complexity and related problems
  Benmansour, Rachid ; Braun, Oliver ; Hanafi, Saïd
• Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP
  Brand, Cornelius ; Dell, Holger ; Roth, Marc 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity of Counting Models of Linear-time Temporal Logic
  Torfah, Hazem ; Zimmermann, Martin 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Time and Space Optimal Counting in Population Protocols
  Aspnes, James ; Beauquier, Joffroy ; Burman, Janna ; Sohier, Devan 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic
  Baillot, Patrick ; Das, Anupam 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression
  Sakai, Takayuki ; Seto, Kazuhisa ; Tamaki, Suguru ; Teruyama, Junichi 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework
  Golovnev, Alexander ; Kulikov, Alexander S. ; Smal, Alexander V. ; Tamaki, Suguru 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Trading Determinism for Time in Space Bounded Computations
  Kallampally, Vivek Anand T. ; Tewari, Raghunath 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Fine-Grained Complexity of Rainbow Coloring
  Kowalik, Lukasz ; Lauri, Juho ; Socala, Arkadiusz 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic
  Sablik, Mathieu ; Schraudner, Michael 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations
  Bournez, Olivier ; Graça, Daniel S. ; Pouly, Amaury 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems
  Fluschnik, Till ; Hermelin, Danny ; Nichterlein, André ; Niedermeier, Rolf 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation
  Williams, Richard Ryan 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Time-Approximation Trade-offs for Inapproximable Problems
  Bonnet, Édouard ; Lampis, Michael ; Paschos, Vangelis Th. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fine-Grained Algorithms and Complexity (Invited Talk)
  Vassilevska Williams, Virginia 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Uncontended Complexity of Anonymous Consensus
  Capdevielle, Claire ; Johnen, Colette ; Kuznetsov, Petr ; Milani, Alessia 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
  Vassilevska Williams, Virginia 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polynomial Time Decidability of Weighted Synchronization under Partial Observability
  Kretinsky, Jan ; Larsen, Kim Guldstrand ; Laursen, Simon ; Srba, Jiri 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Rank Logic is Dead, Long Live Rank Logic!
  Grädel, Erich ; Pakusa, Wied 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik