About: Analysis of algorithms and problem complexity

À propos de : Analysis of algorithms and problem complexity Goto Sponge NotDistinct Permalink

Attributs	Valeurs
type	Concept
rdfs:seeAlso	Analysis of algorithms
skos:inScheme	MSC 2010
broader concept	Theory of computing
skos:prefLabel	Analysis of algorithms and problem complexity 算法分析和问题复杂性 Analisi degli algoritmi e complessitÃ¡ dei problemi
skos:exactMatch	http://msc2010.org/resources/MSC/2000/68Q25
skos:altLabel	Analysis of algorithms and problem complexity [See also 68W40] Analisi degli algoritmi e complessitÃ¡ dei problemi [Vedi anche 68W40] 算法分析和问题复杂性[参见68W40]
http://msc2010.org...0/msc2010#seeAlso	Analysis of algorithms
skos:closeMatch	from MSC1991 value of: Analysis of algorithms and problem complexity
skos:notation	68Q25
skos:note	See also 68W40.
skos:relatedMatch	http://msc2010.org/resources/MSC/2010/fullDD21-005.13
skos:semanticRelation	Analysis of algorithms
is rdfs:seeAlso of	Algorithms; complexity Computational aspects related to convexity Complexity and performance of numerical algorithms Analysis of algorithms Abstract computational complexity for mathematical programming problems
is Subject of	Threshold Circuits for Iterated Matrix Product and Powering Similarity relations and cover automata A complete characterization of primitive recursive intensional behaviours Hopcroft's algorithm and tree-like automata Advice complexity of disjoint path allocation Super-polynomial approximation branching algorithms Improving the solution complexity of the scheduling problem with deadlines: A general technique Tree inclusion problems The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification An Improved Algorithm for a Bicriteria Batching Scheduling Problem Viterbi algorithms for Hidden semi-Markov Models with application to DNA Analysis Packing of (0, 1)-matrices Measuring the problem-relevant information in input Abelian periods, partial words, and an extension of a theorem of Fine and Wilf Convolutive decomposition and fast summation methods for discrete-velocity approximations of the Boltzmann equation The partial inverse minimum cut problem with L1-norm is strongly NP-hard An improved binary search algorithm for the Multiple-Choice Knapsack Problem Unambiguous erasing morphisms in free monoids A survey on combinatorial optimization in dynamic environments A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation On-line models and algorithms for max independent set Labeled shortest paths in digraphs with negative and positive edge weights On the proper intervalization of colored caterpillar trees Advice Complexity and Barely Random Algorithms Deciding inclusion of set constants over infinite non-strict data structures Incremental DFA minimisation A classification scheme for integrated staff rostering and scheduling problems Computing ϵ-Free NFA from Regular Expressions in O( n log 2( n)) Time Synchronizing series-parallel deterministic finite automata with loops and related problems Complexity issues of perfect secure domination in graphs On the computational difficulty of the terminal connection problem Flux recovery for Cut Finite Element Method and its application in a posteriori error estimation Complexity of inheritance of ℱ-convexity for restricted games induced by minimum partitions Computing some role assignments of Cartesian product of graphs Algorithmic aspects of Roman {3}-domination in graphs Computing role assignments of Cartesian product of graphs On the median-of-k version of Hoare's selection algorithm On the number of iterations required by Von Neumann addition Random Generation for Finitely Ambiguous Context-free Languages Time and space complexity of reversible pebbling An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances On Distributive Fixed-Point Expressions Improved Lower Bounds on the Approximability of the Traveling Salesman Problem An Upper Bound on the Space Complexity of Random Formulae in Resolution Job shop scheduling with unit length tasks Improved approximations for ordered TSP on near-metric graphs Wavelet compression of anisotropic integrodifferential operators on sparse tensor product spaces Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem On the computational complexity of the strong geodetic recognition problem A relaxed approach for curve matching with elastic metrics Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7
is narrower concept of	Theory of computing
is http://msc2010.org...msc2010#forTarget of	http://msc2010.org/resources/MSC/2010/52B55-to-68Q25-seeFor
is http://msc2010.org...0/msc2010#seeAlso of	Algorithms; complexity Complexity and performance of numerical algorithms Analysis of algorithms Abstract computational complexity for mathematical programming problems
is http://msc2010.org...#seeConditionally of	Computational aspects related to convexity
is skos:semanticRelation of	Algorithms; complexity Computational aspects related to convexity Complexity and performance of numerical algorithms Analysis of algorithms Abstract computational complexity for mathematical programming problems

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata