„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Analyzing evolutionary algorithms – the computer science perspective
  Jansen, Thomas 2013 Springer
• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
  Buss, S. ; Impagliazzo, R. ; Krajíček, J. ; Pudlák, P. ; Razborov, A. A. ; Sgall, J.
• The complexity of computing maximal word functions
  Allender, Eric ; Bruschi, Danilo ; Pighizzini, Giovanni
• A novel approach of low complexity distributed UA algorithm is used for traffic load balancing and interference in next generation networks
  Elamaran, E. ; Murugaveni, S. ; Jyothi, S. ; Prabhu, M. Ramkumar ; Chitra, M. P. ; Talasila, Vamsidhar
• The quantifier structure of sentences that characterize nondeterministic time complexity
  Lynch, James F.
• An Algorithm for General Set Unification and Its Complexity
  Stolzenburg, Frieder
• Computational genomics-proteomics and Phylogeny analysis of twenty one mycobacterial genomes (Tuberculosis & non Tuberculosis strains)
  Zakham, Fathiah ; Aouane, Othmane ; Ussery, David ; Benjouad, Abdelaziz ; Ennaji, Moulay Mustapha
• A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
  Nip, Kameng ; Wang, Zhenbo
• Travelling on Graphs with Small Highway Dimension
  Disser, Yann ; Feldmann, Andreas Emil ; Klimm, Max ; Koenemann, Jochen
• Advanced tools and methods for treewidth-based problem solving
  Hecher, Markus
• Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming
  Schawe, Hendrik ; Bleim, Roman ; Hartmann, Alexander K.
• Discontinuous information in the worst case and randomized settings †
  Hinrichs, Aicke ; Novak, Erich ; Woźniakowski, Henryk
• Deterministic Constructions of High-Dimensional Sets with Small Dispersion
  Ullrich, Mario ; Vybíral, Jan
• On the complexity of planar Boolean circuits
  Turán, György
• Special issue on circuit complexity: Foreword
  McKenzie, Pierre ; Thérien, Denis
• The computational complexity of recognizing permutation functions
  Ma, Keju ; Gathen, Joachim von zur
• Matching Cut in Graphs with Large Minimum Degree
  Chen, Chi-Yeh ; Hsieh, Sun-Yuan ; Le, Hoang-Oanh ; Le, Van Bang ; Peng, Sheng-Lung
• An Adversarial Model for Scheduling with Testing
  Dürr, Christoph ; Erlebach, Thomas ; Megow, Nicole ; Meißner, Julie
• Robust Reoptimization of Steiner Trees
  Goyal, Keshav ; Mömke, Tobias
• Nested Convex Bodies are Chaseable
  Bansal, Nikhil ; Böhm, Martin ; Eliáš, Marek ; Koumoutsos, Grigorios ; Umboh, Seeun William