„descriptive complexity“

Suchergebnisse

1.000+ Treffer

• On Invariant Formulae of First-Order Logic with Numerical Predicates
  Harwath, Frederik ; Schweikardt, Nicole ; Kreutzer, Stephan ; Segoufin, Luc 2018 Humboldt-Universität zu Berlin
• Parameterized complexity of weighted team definability
  Kontinen, Juha ; Mahmood, Yasir ; Meier, Arne ; Vollmer, Heribert 2024 Gottfried Wilhelm Leibniz Universität Hannover
• Capturing Relativized Complexity Classes without Order
  Dawar, Anuj ; Gottlob, Georg ; Hella, Lauri
• Dependence logic with a majority quantifier
  Durand, Arnaud ; Ebbing, Johannes ; Kontinen, Juha ; Vollmer, Heribert 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parallel Computation with Algebraic Structures A Circuitous Route
  Barlag, Timon 2025 Gottfried Wilhelm Leibniz Universität Hannover
• Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints
  Kleest-Meißner, Sarah ; Sattler, Rebecca ; Schmid, Markus L. ; Schweikardt, Nicole ; Weidlich, Matthias 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dynamic Graph Queries
  Muñoz, Pablo ; Vortmeier, Nils ; Zeume, Thomas 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exploring the experiences of parent caregivers of children with chronic medical complexity during pediatric intensive care unit hospitalization: an interpretive descriptive study
  Rennick, Janet E. ; St-Sauveur, Isabelle ; Knox, Alyssa M. ; Ruddy, Margaret
• Evaluation of pharmacotherapy complexity in residents of long-term care facilities: a cross-sectional descriptive study
  Alves-Conceição, Vanessa ; Silva, Daniel Tenório da ; Santana, Vanessa Lima de ; Santos, Edileide Guimarães dos ; Santos, Lincoln Marques Cavalcante ; Lyra, Divaldo Pereira de
• Uniformity Within Parameterized Circuit Classes
  Hegeman, Steef ; Martens, Jan ; Laarman, Alfons 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Descriptive complexity of learning
  Bergerem, Steffen ˜vanœ ; Grohe, Martin ; Siebertz, Sebastian 2023 Universitätsbibliothek der RWTH Aachen
• Descriptive complexity of circuit-based counting classes
  Haak, Anselm 2021 Gottfried Wilhelm Leibniz Universität
• Capturing Polynomial Time and Logarithmic Space using Modular Decompositions and Limited Recursion
  Grußien, Berit ; Grohe, Martin ; Schweikardt, Nicole ; Köbler, Johannes 2017 Humboldt-Universität zu Berlin
• Characterizing NC¹ with Typed Monoids
  Dawar, Anuj ; Evans, Aidan T. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Descriptive attributes of analysis use cases in the data-driven validation of elements in the system of objectives
  Wagenmann, Steffen ; Weidinger, Felicia ; Schöck, Moritz ; Albers, Albert ; Bursac, Nikola 2023 Technische Universität Hamburg. Universitätsbibliothek
• A parameterized halting problem, Δ0 truth and the MRDP theorem
  Chen, Yijia ; Müller, Moritz ; Yokoyama, Keita 2024 Universität Passau
• Descriptive complexity of #AC0 functions
  Durand, Arnaud ; Haak, Anselm ; Kontinen, Juha ; Vollmer, Heribert 2016 Gottfried Wilhelm Leibniz Universität Hannover
• Small dynamic complexity classes
  Zeume, Thomas ; Grädel, Erich ; Schwentick, Thomas 2015 Universitätsbibliothek Dortmund
• Small Dynamic Complexity Classes – An Investigation into Dynamic Descriptive Complexity
  Zeume, Thomas 2017 Springer International Publishing
• Descriptive Set Theoretic Methods in Automata Theory – Decidability and Topological Complexity
  Skrzypczak, Michał 2016 Springer Berlin Heidelberg