„local completeness“

Suchergebnisse

1.000+ Treffer

• A Generalization of Nemhauser and Trotter's Local Optimization Theorem
  Fellows, Michael R. ; Guo, Jiong ; Moser, Hannes ; Niedermeier, Rolf 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• OntoCheck: verifying ontology naming conventions and metadata completeness in Protégé 4
  Schober, Daniel ; Tudose, Ilinca ; Svátek, Vojtěch ; Boeker, Martin 2012 Universität
• The Completeness Relation and the Local Density Approximation for Layer Structures in Microelectronics
  Kelber, J. ; Schnittler, Ch. ; Paasch, G.
• Locally Maximal Clones II
  Rosenberg, Ivo G. ; Schweigert, Dietmar 1999 Technische Universität Kaiserslautern, Fachbereich Mathematik
• Non-local boundary value problems for mixed type equations with non-smooth line of changing type with spectral parameter
  Mamajonov, Jahongir D. 2008 Freie Universität Berlin
• Nature conservation evaluation of strictly protected forest reserves – an exemplary application in Germany
  Schultze, Juliane ; Reif, Albert 2015 Universität
• PLS-Completeness of String Permutations
  Scheder, Dominik ; Tantow, Johannes 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Broadening the applicability of local completeness analysis with intensional and extensional guarantees
  Ascari, Flavio ; Bruni, Roberto ; Gori, Roberta 2025 KOPS Universität Konstanz
• On the completeness of localic groups via generators and relations
  Mthethwa, Simo S. ; Ntombela, Onesipho
• Abstract, Compositional Consistency: Isabelle/HOL Locales for Completeness à la Fitting
  From, Asta Halkjær ; Schlichtkrull, Anders 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Model Checking as Program Verification by Abstract Interpretation
  Baldan, Paolo ; Bruni, Roberto ; Ranzato, Francesco ; Rigo, Diletta 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The power of locality: Exploring the limits of randomness in distributed computing
  Maus, Yannic
• Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Casel, Katrin ; Day, Joel ; Fleischmann, Pamela ; Kociumaka, Tomasz ; Manea, Florin ; Schmid, Markus L. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Local Completeness for Program Correctness and Incorrectness (Invited Talk)
  Bruni, Roberto 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard
  Komusiewicz, Christian ; Morawietz, Nils 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems
  Kikuchi, Kentaro ; Aoto, Takahito 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
  Grochow, Joshua A. ; Qiao, Youming 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games
  Fotakis, Dimitris ; Kandiros, Vardis ; Lianeas, Thanasis ; Mouzakis, Nikos ; Patsilinakos, Panagiotis ; Skoulakis, Stratis 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Localq-completeness of complements of smooth CR-submanifolds
  Schwarz, Wolfgang
• On quasi-completeness and sequential completeness in locally convex spaces.
  VALDIVIA, Manuel