Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Vladimir Ovchinnikov
Analyses of Possibility of Automation of Ways of Reducing the Computational Complexity of Algorithms on Sets and Graphs Abstract. Field of Study of This Work - Algorithms for Solving Combinatorial Optimization
On-line Journal "Naukovedenie"
Related publications
Reducing the Complexity of LDPC Decoding Algorithms: An Optimization-Oriented Approach
Another Motivation for Reducing the Randomness Complexity of Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Computational Algorithms for Solving Variants of Fuerst's Model
Practical Problem Solving With Cutting Plane Algorithms in Combinatorial Optimization
Combinatorial Optimization
Application of Fuzzy Sets for the Improvement of Routing Optimization Heuristic Algorithms
Transport and Telecommunication
Engineering
Computer Science Applications
RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems With Combinatorial Explosion
Fundamenta Informaticae
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
Computational Algorithms for Unconstrained Optimization
Tree Spanners on Chordal Graphs: Complexity and Algorithms
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
Journal of Graph Algorithms and Applications
Geometry
Computer Science Applications
Computer Science
Mathematics
Computational Theory
Theoretical Computer Science
Topology
