Results 61 to 70 of about 2,188,345 (345)
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
npj Quantum Information, 2022 We investigate the problem of synthesizing T-depth optimal quantum circuits for exactly implementable unitaries over the Clifford+T gate set. We construct a subset, $${{\mathbb{V}}}_{n}$$ V n , of T-depth 1 unitaries.
Vlad Gheorghiu +2 more
doaj +1 more source
Stochasticity in Algorithmic Statistics for Polynomial Time.
Electron. Colloquium Comput. Complex., 2017 A fundamental notion in Algorithmic Statistics is that of a stochastic object, i.e., an object having a simple plausible explanation. Informally, a probability distribution is a plausible explanation for x if it looks likely that x was drawn at random with respect to that distribution.
Alexey Milovanov +1 more
openaire +4 more sources
Polynomial Time and Parameterized Approximation Algorithms for Boxicity [PDF]
, 2012 The boxicity (cubicity) of a graph G, denoted by box(G) (respectively cub(G)), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (cubes) in ℝk. The problem of computing boxicity (cubicity) is known to be inapproximable in polynomial time even for graph classes like bipartite, co-bipartite and split
Adiga, Abhijin +2 more
openaire +2 more sources
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
, 2010 An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
Clustering Affine Subspaces: Algorithms and Hardness [PDF]
, 2012 We study a generalization of the famous k-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinations of parameters.
Lee, Euiwoong
core +1 more source
Advanced Engineering Materials, EarlyView.A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
Solving Fuzzy Polynomial Equations Systems Using Wu’s Method [PDF]
پژوهشهای نظری و کاربردی هوش ماشینیIn this paper, we introduce a method grounded in Wu’s algorithm for determining real solutions of systems of fuzzy polynomial equations. We initially calculate the r-cuts of a fuzzy polynomial equations system and derive a parametric representation for ...
Hamed Farahani
doaj +1 more source
A Polynomial Time Algorithm for Unidimensional Unfolding Representations
Journal of Algorithms, 1994 Summary: Two conditions on a collection of simple orders -- unimodality and straightness -- are necessary but not jointly sufficient for unidimensional unfolding representations. From the analysis of these conditions, a polynomial time algorithm is derived for the testing of unidimensionality and for the construction of a representation when one exists.
Doignon, Jean-Paul +1 more
openaire +3 more sources
Polynomial Time Algorithms for Tracking Path Problems [PDF]
Algorithmica, 2020 AbstractGiven a graphG, and terminal verticessandt, theTracking Pathsproblem asks to compute a set of minimum number of vertices to be marked as trackers, such that the sequence of trackers encountered in each$$s$$s-$$t$$tpath is unique.Tracking PathsisNP-hard in both directed and undirected graphs in general.
openaire +4 more sources
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
, 2014 Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V. +5 more
core +1 more source