„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Maximizing a Submodular Function with Viability Constraints
  Dvorak, Wolfgang ; Henzinger, Monika ; Williamson, David P.
• 2D Lyndon Words and Applications
  Marcus, Shoshana ; Sokol, Dina
• Campaign Management Under Approval-Driven Voting Rules
  Schlotter, Ildikó ; Faliszewski, Piotr ; Elkind, Edith
• Computing the Visibility Polygon of an Island in a Polygonal Domain
  Chen, Danny Z. ; Wang, Haitao
• Quantum Pattern Matching Fast on Average
  Montanaro, Ashley
• Revenue and Reserve Prices in a Probabilistic Single Item Auction
  Alon, Noga ; Feldman, Moran ; Tennenholtz, Moshe
• Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
  Ueno, Koji ; Suzumura, Toyotaro ; Maruyama, Naoya ; Fujisawa, Katsuki ; Matsuoka, Satoshi
• Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson–Crick and Nussinov–Jacobson Energy Models
  Haleš, Jozef ; Heliou, Alice ; Maňuch, Ján ; Ponty, Yann ; Stacho, Ladislav
• Big Graph Analyses: From Queries to Dependencies and Association Rules
  Fan, Wenfei ; Hu, Chunming
• Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem
  Zhang, Peng ; Fu, Bin ; Tang, Linqing
• Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP
  Cheriyan, Joseph ; Gao, Zhihan
• Correcting capabilities of binary irregular LDPC code under low-complexity iterative decoding algorithm
  Rybin, P. S.
• A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
  Zhu, Wei ; Gao, Xiao-Shan
• Explicit Expanding Expanders
  Dinitz, Michael ; SCHAPIRA, MICHAEL ; Valadarsky, Asaf
• Graph Isomorphism, Color Refinement, and Compactness
  Arvind, V. ; Köbler, Johannes ; Rattan, Gaurav ; Verbitsky, Oleg
• Low-degree test with polynomially small error
  Moshkovitz, Dana
• On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace
  Doron, Dean ; Sarid, Amir ; Ta-Shma, Amnon
• Robust Proximity Search for Balls Using Sublinear Space
  Har-Peled, Sariel ; Kumar, Nirman
• Secluded Connectivity Problems
  Chechik, Shiri ; Johnson, M. P. ; Parter, Merav ; Peleg, David
• A Connection Between Sports and Matroids: How Many Teams Can We Beat?
  Schlotter, Ildikó ; Cechlárová, Katarína