„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Graphs, Networks and Algorithms
  Jungnickel, Dieter 2013 Springer Berlin Heidelberg
• A Closer Look Towards Arithmetic Algorithms – With BKS Process
  Biswas, Barun ; Basuli, Krishnendu ; Sen Sarma, Samar 2012 LAP LAMBERT Academic Publishing
• The Complexity of Valued Constraint Satisfaction Problems
  Živný, Stanislav 2012 Springer Berlin Heidelberg
• The complexity of valued constraint satisfaction problems
  Živný, Stanislav 2012 Springer
• Decision and game theory for security – third international conference ; proceedings
  Grossklags, Jens ; Walrand, Jean 2012 Springer
• Intelligent Gas Recognition System – Analysis and Design Issues
  Ojha, Varun Kumar ; Dutta, Paramartha 2012 LAP LAMBERT Academic Publishing
• 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2012)
  Delling, Daniel ; Liberti, Leo 2012 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Distributed Universality
  Raynal, Michel ; Stainer, Julien ; Taubenfeld, Gadi
• Streaming Algorithms for Independent Sets in Sparse Hypergraphs
  Halldórsson, Bjarni V. ; Halldórsson, Magnús M. ; Losievskaja, Elena ; Szegedy, Mario
• Observability of Lattice Graphs
  Han, Fangqiu ; Suri, Subhash ; Yan, Xifeng
• Succinct Posets
  Munro, J. Ian ; Nicholson, Patrick K.
• Matrix Sparsification and the Sparse Null Space Problem
  Gottlieb, Lee-Ad ; Neylon, Tyler
• Planar Disjoint-Paths Completion
  Adler, Isolde ; Kolliopoulos, Stavros G. ; Thilikos, Dimitrios M.
• An $$O(n^2)$$ O ( n 2 ) Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension
  Rajabi-Alni, Fatemeh ; Bagheri, Alireza
• It’s a Small World for Random Surfers
  Mehrabian, Abbas ; Wormald, Nick
• Approximate Well-supported Nash Equilibria Below Two-thirds
  Fearnley, John ; Goldberg, Paul W. ; Savani, Rahul ; Sørensen, Troels Bjerre
• Convex Hulls Under Uncertainty
  Agarwal, Pankaj K. ; Har-Peled, Sariel ; Suri, Subhash ; Yıldız, Hakan ; Zhang, Wuzhou
• Set It and Forget It: Approximating the Set Once Strip Cover Problem
  Bar-Noy, Amotz ; Baumer, Ben ; Rawitz, Dror
• Using efficient average case algorithms to collapse worst-case complexity classes
  Köbler, Johannes ; Schuler, Rainer 1997 Univ., Fak. für Informatik
• A Grouping Approach for Succinct Dynamic Dictionary Matching
  Feigenblat, Guy ; Porat, Ely ; Shiftan, Ariel