scientific article; zbMATH DE number 793950
From MaRDI portal
Publication:4846806
zbMath0847.68046MaRDI QIDQ4846806
Publication date: 10 September 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Closed form numerical solutions of variable coefficient linear second-order elliptic problems, Path-based depth-first search for strong and biconnected components, Path Problems in Complex Networks, Efficient algorithms for combined heat and power production planning under the deregulated electricity market, \(\text{CO}_{2} \) emissions trading planning in combined heat and power production via multi-period stochastic optimization, Fast transformation from time series to visibility graphs, Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox, A classification rule reduction algorithm based on significance domains, Two algorithms for the student-project allocation problem, Hyper-minimizing minimized deterministic finite state automata, A general stability analysis on regional and national voting schemes against noise -- why is an electoral college more stable than a direct popular election?, A Real Elementary Approach to the Master Recurrence and Generalizations, Alternating space is closed under complement and other simulations for sublogarithmic space, Should one always use repeated squaring for modular exponentiation?, Popular matchings in the weighted capacitated house allocation problem, Prime simplicity, Complement for two-way alternating automata, Bucket elimination for multiobjective optimization problems, Fractional Approaches in Path Tracking Design (or Motion Control): Prefiltering, Shaping, and Flatness, Algorithms for randomized time-varying knapsack problems, Parallelizations of the Error Correcting Code Problem, Super-stability in the student-project allocation problem with ties, Efficiency of minimizing compositions of convex functions and smooth maps, A low computational cost numerical method for solving mixed diffusion problems, An approach to improve argumentation-based epistemic planning with contextual preferences, The efficiency of primitive recursive functions: a programmer's view
