1
Assuntos:
“...Exact algorithms...”
Algorithms, parameters and complexity for graph partitioning problems
Tese
2
3
“... of NP-completeness and efficient algorithms for certain convexity parameters for this new one, as well as approximate...”
Complexity and algorithms related to two classes of graph problems
Tese
4
“... compared to the best known algorithms in the literature, our matheuristic outperformed the other proposals...”
The k-labeled spanning forest problem : complexity, approximability, formulations and algorithms
Dissertação
5
“... classes of low complexity approximations for the KLT and the DCT, fast algorithms, and demonstrate their...”
Low-complexity approximations for discrete transforms : design, fast algorithms, image coding, and use as a tool in statistical inference
Tese
6
Assuntos:
“...Algorithms...”
First-order regularized algorithms with complexity properties for order-valued and low-order-valued optimization problems
Tese
7
Assuntos:
“...Low complexity...”
Nonlinear adaptive algorithms with tensor rank decompositions.
Tese
8
Assuntos:
“...Algorithms development...”
Análise formal da complexidade de algoritmos genéticos
Dissertação
9
10
Assuntos:
“...Colouring algorithms...”
Structural and complexity studies in inversions and colouring heuristics of (oriented) graphs
Tese
11
Assuntos:
“...Computational complexity...”
Complexidade computacional e o problema P vs NP
Dissertação
12
Assuntos:
“...Quantum algorithms...”
An introduction to quantum: computing, communication complexity protocols, nonlocality and graph parameters
Dissertação
13
Assuntos:
“...Complexity of Algorithms...”
Sobre ferramentas para análise automatizada de algoritmos
Dissertação
14
Assuntos:
“...Complexity of Algorithms...”
Avaliação de Usabilidade e Aprendizagem de Algoritmos com o uso do TuPy Online
Dissertação
15
“..., as the complexity of a domain grows, so does the size and complexity of the model that represents...”
Ontology-based complexity management in conceptual modeling
Tese
16
“... environments. However, as they are usually applied in real-time applications, they must be based on algorithms...”
Low-complexity approximations for the Kalman filter.
Tese
18
“... complexity O(√N ), where N is the domain size of the function. For the case of a 1024-bit key, Grover...”
Cryptographic algorithms based on Ramanujan graphs
Tese