Search
Search Results
-
An improved BKW algorithm on the learning with rounding problem
The Blum-Kalai-Wasserman (BKW) algorithm is a significant combinatorial algorithm used to tackle the Learning with Errors (LWE) and Learning with...
-
A Novel Zero-Watermarking Algorithm Based on Texture Complexity Analysis
Aiming at the problem of existing watermarking algorithms cannot effectively resist complex attacks, a novel zero-watermarking algorithm based on...
-
Victoria Amazonica optimization algorithm based on adaptive mutation factor and mathematical distribution for solving minimum spanning tree problem
The minimum spanning tree problem is of great importance in the field of graph theory and optimization, which can be regarded as an optimization...
-
A genetic engineering algorithm for the generalized quadratic assignment problem
The generalized quadratic assignment problem (GQAP) poses a significant challenge in optimization, known for its NP-hard complexity and wide-ranging...
-
An Enhanced Approximation Algorithm Using Red Black Tree and HashMap for Virtual Machine Placement Problem
The virtual machine placement problem (VMPP) is an np-hard optimization problem in cloud computing that involves efficiently allocating virtual...
-
New Results on the Remote Set Problem and Its Applications in Complexity Study
In 2015, Haviv introduced the Remote set problem (RSP) and studied the complexity of the covering radius problem (CRP), which is a classical problem...
-
Complexity Analysis
This Chapter advocates a structure-oriented approach to simplify and generalize complexity investigations. The DIAGONALIZATION and REDUCTION methods...
-
Exact distributed quantum algorithm for generalized Simon’s problem
Simon’s problem is one of the most important problems demonstrating the power of quantum algorithms, as it greatly inspired the proposal of Shor’s...
-
Recovering the Original Simplicity: Succinct and Exact Quantum Algorithm for the Welded Tree Problem
This work revisits quantum algorithms for the well-known welded tree problem, proposing a succinct quantum algorithm based on the simple coined...
-
Discrete orca predation algorithm for the traveling salesman problem
The traveling salesman problem (TSP) is a frequently studied problem by researchers today and belongs to the class of combinatorial optimization...
-
A multi-population evolutionary algorithm for multi-objective constrained portfolio optimization problem
Due to the rapid development of the financial market, the portfolio selection problem has become of the most complex problem in finance. This paper...
-
Assessing ChatGPT for Algorithm Time Complexity Education
We present the results of experiments performed using ChatGPT versions 3.5 and 4o to explore the possibilities of generating and solving exam...
-
Tractable probabilistic models and computational complexity
Probabilistic models with tractable marginalization are those in which evidence queries involving marginalization of variables are guaranteed to be...
-
Bi-objective parameter setting problem of a genetic algorithm: an empirical study on traveling salesperson problem
Genetic Algorithm (GA) is a widely used metaheuristic for addressing challenging optimization problems. Selecting suitable settings for GA parameters...
-
Memory-Efficient BKW Algorithm for Solving the LWE Problem
The study of attack algorithms for the Learning with Errors (LWE) problem is crucial for the cryptanalysis of LWE-based cryptosystems. The BKW...
-
A binary bat algorithm with improved crossover operators and Cauchy mutation for unit commitment problem
Power system operators are faced with the problem of unit commitment belonging to mixed integer programming, which becomes very complicated, as units...
-
Mitigating the task scheduling problem in fog computing environments using improved marine predators optimization algorithm
Cloud and fog computing architectures decentralize the computational demands of both users and interconnected IoT devices. With the tremendous...
-
Chaotic opposition-based plant propagation algorithm for engineering problem
The Plant Propagation Algorithm (PPA), often exemplified by the Strawberry Algorithm, has demonstrated its effectiveness in solving lower-dimensional...
-
Algorithm Analysis
This chapter introduces readers to how we analyze algorithm performance through asymptotic analysis. We will discuss Big-Oh, Big-Omega, and Theta...
-
Modified imperialist competitive algorithm for aircraft landing scheduling problem
In recent years, airport runways have become a more critical bottleneck in airports, and it is very unusual to use only one runway to solve the...
