„algorithm complexity“

Suchergebnisse

4.228 Treffer

• On the complexity of computing Kronecker coefficients
  Pak, Igor ; Panova, Greta
• On the Structure of Boolean Functions with Small Spectral Norm
  Shpilka, Amir ; Tal, Avishay ; Volk, Ben lee
• Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
  Aydınlıoğlu, Barış ; Melkebeek, Dieter van
• An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths
  Micek, Piotr ; Wiechert, Veit
• Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games
  Comin, Carlo ; Rizzi, Romeo
• Local Computation Algorithms for Graphs of Non-constant Degrees
  Levi, Reut ; Rubinfeld, Ronitt ; Yodpinyanee, Anak
• Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques
  Fomin, Fedor V. ; Liedloff, Mathieu ; Montealegre, Pedro ; Todinca, Ioan
• Context-Aware Recommendations with Random Partition Factorization Machines
  Wang, Shaoqing ; Li, Cuiping ; Zhao, Kankan ; Chen, Hong
• An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
  Genova, Kyle ; Williamson, David P.
• Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened
  Hu, Xiaocheng ; Tao, Yufei ; Yang, Yi ; Zhou, Shuigeng
• Minimizing the Diameter of a Spanning Tree for Imprecise Points
  Liu, Chih-Hung ; Montanari, Sandro
• A trust region algorithm with a worst-case iteration complexity of $$\mathcal{O}(\epsilon ^{-3/2})$$ O ( ϵ - 3 / 2 ) for nonconvex optimization
  Curtis, Frank E. ; Robinson, Daniel P. ; Samadi, Mohammadreza
• Special Issue Editorial
  Wang, X. Sean ; Du, Xiaoyong ; Xiong, Hui
• Efficient Maximal Clique Enumeration Over Graph Data
  Hou, Boyi ; Wang, Zhuo ; Chen, Qun ; Suo, Bo ; Fang, Chao ; Li, Zhanhuai ; Ives, Zachary G.
• Local Weighted Matrix Factorization for Top-n Recommendation with Implicit Feedback
  Wang, Keqiang ; Peng, Hongwei ; Jin, Yuanyuan ; Sha, Chaofeng ; Wang, Xiaoling
• Pre-computed Region Guardian Sets Based Reverse kNN Queries
  Song, Wei ; Qin, Jianbin ; Cheema, Muhammad Aamir ; Wang, Wei
• An I/O-Efficient Buffer Batch Replacement Policy for Update-Intensive Graph Databases
  Zhou, Ningnan ; Zhou, Xuan ; Zhang, Xiao ; Wang, Shan
• Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications
  Das Gupta, Bhaskar ; Karpinski, Marek ; Mobasheri, Nasim ; Yahyanejad, Farzane
• Theory of Automata and State Complexity
  Syzdykov, Mirzakhmet 2017 LAP LAMBERT Academic Publishing
• Discounted Reward TSP
  Farbstein, Boaz ; Leṿin, Asaf