„Complex problems“

Suchergebnisse

2.217 Treffer

• Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
  Ganian, Robert ; Hlinený, Petr ; Obdrzálek, Jan 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Holant Problems for Regular Graphs with Complex Edge Functions
  Kowalczyk, Michael ; Cai, Jin-Yi 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Covering and Boundedness Problems for Branching Vector Addition Systems
  Demri, Stéphane ; Jurdzinski, Marcin ; Lachish, Oded ; Lazic, Ranko 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards a Unified Theory of Sparsification for Matching Problems
  Assadi, Sepehr ; Bernstein, Aaron 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Search versus Decision for Election Manipulation Problems
  Hemaspaandra, Edith ; Hemaspaandra, Lane A. ; Menton, Curtis 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)
  Gál, Anna ; Mahajan, Meena ; Santhanam, Rahul ; Tantau, Till ; Paraashar, Manaswi
• Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121)
  Gál, Anna ; Mahajan, Meena ; Santhanam, Rahul ; Tantau, Till
• Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 19341)
  Bilyk, Dmitriy ; Hinrichs, Aicke ; Kuo, Frances Y. ; Ritter, Klaus
• Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131)
  Diekert, Volker ; Kharlampovich, Olga ; Lohrey, Markus ; Myasnikov, Alexei
• Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)
  Gál, Anna ; Santhanam, Rahul ; Tantau, Till
• Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361)
  Brattka, Vasco ; Dzhafarov, Damir D. ; Marcone, Alberto ; Pauly, Arno
• Computational Counting (Dagstuhl Seminar 17341)
  Bezáková, Ivona ; Goldberg, Leslie Ann ; Jerrum, Mark R.
• Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121)
  Gál, Anna ; Koucký, Michal ; Regev, Oded ; Tantau, Till
• Coding Theory in the Time of Big Data (Dagstuhl Seminar 16321)
  Bossert, Martin ; Byrne, Eimear ; Soljanin, Emina
• Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)
  Hinrichs, Aicke ; Traub, Joseph F. ; Wozniakowski, Henryk ; Yaroslavtseva, Larisa
• Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)
  Bürgisser, Peter ; Cucker, Felipe ; Karpinski, Marek ; Vorobjov, Nicolai
• Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)
  Gal, Anna ; Koucky, Michal ; Regev, Oded ; Reischuk, Rüdiger
• Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)
  Keller, Alexander ; Kuo, Frances ; Neuenkirch, Andreas ; Traub, Joseph F.
• Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)
  Brandstädt, Andreas ; Golumbic, Martin Charles ; Heggernes, Pinar ; McConnell, Ross
• Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)
  Grohe, Martin ; Koucky, Michal ; Reischik, Rüdiger ; van Melkebeek, Dieter