„Complexity Classes“

Suchergebnisse

232 Treffer

• Small dynamic complexity classes
  Zeume, Thomas ; Grädel, Erich ; Schwentick, Thomas 2015 Universitätsbibliothek Dortmund
• Complexity Theory
  Sina, Lucien 2025 epubli
• Solving Problems on Graphs: From Structure to Algorithms (Dagstuhl Seminar 25041)
  Agrawal, Akanksha ; Chudnovsky, Maria ; Paulusma, Daniël ; Schaudt, Oliver ; Codsi, Julien
• Intrinsic classes in the Union of European Football Associations soccer team ranking
  Ausloos, Marcel
• Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion
  Morelle, Laure ; Sau, Ignasi ; Thilikos, Dimitrios M. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Oracle with no UP-Complete Sets, but NP – = PSPACE
  Dingel, David ; Egidy, Fabian ; Glaßer, Christian 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Small Dynamic Complexity Classes – An Investigation into Dynamic Descriptive Complexity
  Zeume, Thomas 2017 Springer International Publishing
• Quantum SAT Problems with Finite Sets of Projectors Are Complete for a Plethora of Classes
  Rivera Cardoso, Ricardo ; Meiburg, Alex ; Nagaj, Daniel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Machines, Computations, and Universality – 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Proceedings
  2015 Springer International Publishing
• Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations
  Antonelli, Melissa ; Durand, Arnaud ; Kontinen, Juha 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Classes of Directed Graphs
  Bang-Jensen, Jørgen ; Gutin, Gregory Z. 2018 Springer International Publishing
• Counting Martingales for Measure and Dimension in Complexity Classes
  Hitchcock, John M. ; Sekoni, Adewale ; Shafei, Hadi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Directed st-Connectivity with Few Paths Is in Quantum Logspace
  Apers, Simon ; Edenhofer, Roman 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
  Lodaya, Kamal ; Mahajan, Meena 2010 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
  Segschneider, Jenny ; Koster, Arie Marinus 2025 Universitätsbibliothek der RWTH Aachen
• (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
  Bathie, Gabriel ; Bousquet, Nicolas ; Cao, Yixin ; Ke, Yuping ; Pierron, Théo
• Parameterized Complexity of Deletion to Scattered Graph Classes
  Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs
  Eickmeyer, Kord ; Giannopoulou, Archontia C. ; Kreutzer, Stephan ; Kwon, O-joung ; Pilipczuk, Michal ; Rabinovich, Roman ; Siebertz, Sebastian 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes
  Curticapean, Radu ; Dell, Holger ; Roth, Marc 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subgraph Isomorphism on Graph Classes that Exclude a Substructure
  Bodlaender, Hans L. ; Hanaka, Tesshu ; Kobayashi, Yasuaki ; Kobayashi, Yusuke ; Okamoto, Yoshio ; Otachi, Yota ; Zanden, Tom C. van der