„Complexity“

Suchergebnisse

10.000+ Treffer

• Lie Groups for Quantum Complexity and Barren Plateau Theory
  Alcântara, P. A. S. de ; Audi, Gabriel ; Morais, Leandro
• The molecular complexity of deep vein thrombosis was preliminarily explored based on the ceRNA network, scRNA-seq and AlphaFold 2
  Pan, Bao-ze ; Luo, Qing-yu ; Jiang, Ming-jun ; Ning, Dan ; Deng, Li-ming ; Dai, Xian-peng ; Wu, Zi-xuan ; Deng, Zhi-he ; Luo, Dong-yang ; Wang, Yang-yi-jing ; Chen, Jie ; Xiong, Guo-zuo ; Bi, Guo-shan
• The emerging landscape of brain glycosylation: from molecular complexity to therapeutic potential
  Seo, Youngsuk ; Park, Ji Eun ; Yu, Jae Young ; Lee, Boyoung ; Yoon, Jong Hyuk ; An, Hyun Joo
• Reliability and state-dependency of EEG connectivity, complexity and network characteristics
  Dominicus, L. S. ; Lodema, D. Y. ; Oranje, B. ; Zandstra, M. G. ; Hermans, A. P. C. ; Imhof, L. ; Otte, W. M. ; Hillebrand, A. ; Ambrosen, K. ; Stam, C. J. ; Ebdrup, B. H. ; Dellen, E. van
• Genre-specific features of second language speech: connectives in exposition and narration
  Hwang, Haerim ; Kim, Hyunwoo
• A systematic analysis on performance and computational complexity of sorting algorithms
  Sundaramoorthy, Sureshkumar ; Karunanidhi, Govardhan
• Identification of post-transcriptional regulation reveals complexity in peanut pod development by Direct RNA
  Wang, Wei ; Guo, Haosong ; Bian, Jianxin ; Cui, Fa ; Liu, Xiaoqin
• A Low-Complexity SBL-Based Method for 2-D DOA Estimation with Two L-Shaped Arrays
  Yang, Jie ; Ma, Jingtao ; Liang, Guang ; Gong, Wenbin
• Computational Complexity of the Choice Problem for Typical Representatives of a Finite Point Set in a Metric Space
  Borisova, I. A.
• Verb-framed spatial deixis in Mesoamerican languages and the increasing complexity of source constructions via Spanish de
  Robbers, Maja ; Hober, Nicole
• Motivational Complexity of Nonsuicidal Self-injury Associated with its Severity in Emerging Adult University Students
  Reinhardt, Melinda ; Kökönyei, Gyöngyi
• The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs
  Horiyama, Takashi ; Seto, Kazuhisa ; Suzuki, Ryu
• Understanding the complexity of cutaneous leishmaniasis patient journey in endemic rural Sri Lanka: a qualitative study
  Gunasekara, Sonali Dinushika ; Wickramasinghe, Nuwan Darshana ; Weerakoon, Kosala Gayan ; Fernando, Manoj Sanjeewa ; Shanthapriya, Sandaru Hasaranga ; Price, Helen Philippa ; Dikomitis, Lisa ; Agampodi, Thilini Chanchala ; Agampodi, Suneth Buddhika
• Balancing complexity in retrofitting: an opposition-based NSGA-III framework for time, cost, quality, energy, safety, environment, and client satisfaction
  Villagómez-Galindo, Miguel ; Martínez-Valencia, Ana Beatriz ; Maurya, Sudhanshu ; Jat, Sushma ; Shrivastava, Gaurav ; Manjunath, T. C.
• PACE Solver Description: OBLX Exact Solver for the Dominating Set Problem
  Dirks, Jona ; Gerhard, Enna ; Kaial, Victoria ; Lorieau, Lucas 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
  Beisegel, Jesse ; Klost, Katharina ; Knorr, Kristin ; Ratajczak, Fabienne ; Scheffler, Robert 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Uniformity Within Parameterized Circuit Classes
  Hegeman, Steef ; Martens, Jan ; Laarman, Alfons 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity of Local Search for CSPs Parameterized by Constraint Difference
  Anand, Aditya ; Cohen-Addad, Vincent ; D'Orsi, Tommaso ; Gupta, Anupam ; Lee, Euiwoong ; Panigrahi, Debmalya ; Peng, Sijin 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient Enumeration of k-Plexes and k-Defective Cliques
  Jiddou, Mohamed ; Manoussakis, George 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deterministically Counting k-Paths and Trees Parameterized by Treewidth in Single-Exponential Time
  Visser, Jonne ; Bodlaender, Hans L. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik