Výsledky vyhľadávania - polynomial time \(\rho\)-approximation algorithm

Quantum Algorithm for Fidelity Estimation Autor Wang, Qisheng, Zhang, Zhicheng, Chen, Kean, Guan, Ji, Fang, Wang, Liu, Junyi, Ying, Mingsheng

“…For two unknown mixed quantum states <inline-formula> <tex-math notation="LaTeX">\rho </tex-math></inline-formula> and <inline-formula> <tex-math notation…”
Získať plný text

Polynomial-Complexity Deadlock Avoidance Policy for Tasks Offloading in Satellite Edge Computing With Data-Dependent Constraints and Limited Buffers Autor Zhang, Ruipeng, Feng, Yanxiang, Yang, Yikang, Li, Xiaoling, Li, Hengnian

“…}} with polynomial complexity is developed for SEC–LB. Moreover, we present an improved version of MBA, namely topology-based Banker's algorithm (TBBA…”
Získať plný text

Subexponential-Time Algorithms for Sparse PCA Autor Ding, Yunzi, Kunisky, Dmitriy, Wein, Alexander S., Bandeira, Afonso S.

“… , it is possible to recover x in polynomial time if ρ ≲ 1 / n . While it is possible to recover x in exponential time under the weaker condition ρ…”
Získať plný text

A quantum version of Pollard's Rho of which Shor's Algorithm is a particular case Autor Bastos, Daniel Chicayban, Kowada, Luis Antonio

“… In translating the algorithm to a quantum model of computation, we found its running time reduces to polynomial-time using a certain set of functions for generating the sequence…”
Získať plný text

Chromatic polynomial of a picture fuzzy graph with application in traffic light control Autor Abbas, Qamar, Mustafa, Ghulam

“… We then discuss the properties of the ( θ , ρ , σ ) -LGs of a PFG. Additionally, we introduce the concept of the chromatic polynomial (CP…”
Získať plný text

Optimized IDW Algorithm for Accurate GPS-IMU Time Synchronization Using Acceleration and Temporal Factors Autor Li, Kemeng, Zhang, Hongli, Wang, Yinggang, Lei, Jun

“… This study proposes time difference and acceleration rate-inverse distance weighting (TDAR-IDW), an adaptive algorithm that integrates time difference and acceleration variation into an exponential weighting framework…”
Získať plný text

Nearly Optimal Sparse Group Testing Autor Gandikota, Venkata, Grigorescu, Elena, Jaggi, Sidharth, Zhou, Samson

“…Group testing is the process of pooling arbitrary subsets from a set of <inline-formula> <tex-math notation="LaTeX"> {n} </tex-math></inline-formula> items so…”
Získať plný text

Optimal learning of quantum Hamiltonians from high-temperature Gibbs states Autor Haah, Jeongwan, Kothari, Robin, Tang, Ewin

“… In the high-temperature (low \beta) regime, their algorithm has sample complexity poly (N, 1/\beta, 1/\varepsilon) and can be implemented with polynomial, but suboptimal, time complexity…”
Získať plný text

Tight Bounds for Quantum State Certification with Incoherent Measurements Autor Chen, Sitan, Li, Jerry, Huang, Brice, Liu, Allen

“… We focus on algorithms which use incoherent measurements, i.e. which only measure one copy of \rho at a time…”
Získať plný text

An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm Autor Li, Zongxia, Gasarch, William

“… in polynomial time, and factoring large numbers more than some limits(200 digits) remain difficult. The security of the current cryptosystems depends on the hardness of factoring large public keys…”
Získať plný text

Randomization of Arithmetic Over Polynomial Modular Number System Autor Didier, Laurent-Stephane, Dosso, Fangan-Yssouf, El Mrabet, Nadia, Marrez, Jeremy, Veron, Pascal

“… In this paper we use, for the first time, the redundancy of PMNS to protect algorithms against Side Channel Attacks (SCA…”
Získať plný text

Integrated Multi-UAV Motion Planning Under Kinematic Constraints Based on Enhanced Conflict-Based Search Autor Li, Liya, Liu, Yucong, Qi, Guoyuan, Ahn, Choon Ki

“…Multi-uncrewed aerial vehicle (UAV) performing tasks in obstacle-intensive aerospace environments requires prior motion planning to mitigate real-time tracking and control challenges…”
Získať plný text

Parallel Quantum Signal Processing Via Polynomial Factorization Autor Martyn, John M., Rossi, Zane M., Cheng, Kevin Z., Liu, Yuan, Chuang, Isaac L.

“… ) ) for a polynomial P ( x ) , which encompasses relevant properties like entropies and fidelity. However, QSP is a sequential algorithm…”
Získať plný text

A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius Autor Xing, Chaoping, Yuan, Chen

“…Compared with classical block codes, list decoding rank-metric codes efficiently seems more difficult. The evidences to support this view include: 1) so far…”
Získať plný text

A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs Autor Attiratanasunthron, Nattapat, Fakcharoenphol, Jittat

“…In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO…”
Získať plný text

Improved parameterized and exact algorithms for cut problems on trees Autor Kanj, Iyad, Lin, Guohui, Liu, Tian, Tong, Weitian, Xia, Ge, Xu, Jinhui, Yang, Boting, Zhang, Fenghui, Zhang, Peng, Zhu, Binhai

“… For the Multicut on Trees problem, we present a parameterized algorithm that runs in time O⁎(ρk), where ρ=2+1<1.554 is the positive root of the polynomial x4…”
Získať plný text

A gap for PPT entanglement Autor Cariello, D.

“…Let W be a finite dimensional vector space over a field with characteristic not equal to 2. Denote by VS and VA the subspaces of symmetric and antisymmetric…”
Získať plný text

The structure of infinitesimal homeostasis in input–output networks Autor Wang, Yangyang, Huang, Zhengyuan, Antoneli, Fernando, Golubitsky, Martin

“…Homeostasis refers to a phenomenon whereby the output x o of a system is approximately constant on variation of an input I . Homeostasis occurs frequently in…”
Získať plný text

Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem Autor Cheon, Jung Hee, Cho, Wonhee, Hhan, Minki, Kim, Jiseung, Lee, Changmin

“… Both algorithms take the same time complexity up to a polynomial factor to solve the variant problem for the bit size of samples , secret primes , and error bound . Our algorithm gives the first parameter condition related to and size. From the results of the experiments, it has been proved that the proposed algorithms work well both in theoretical and experimental terms…”
Získať plný text

Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size Autor Tapolcai, Janos, Ronyai, Lajos, Vass, Balazs, Gyimothi, Laszlo

“…At backbone network planning, an important task is to identify the failures to get prepared for. Technically, a list of link sets, called Shared Risk Link…”
Získať plný text