Results 11 to 20 of about 1,237,463 (291)

Superlinear advantage for exact quantum algorithms [PDF]

Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013
A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms.
Ambainis, Andris
core   +4 more sources

Exact Algorithms for Edge Domination [PDF]

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Rooij, J.M.M., Bodlaender, H.L.
openaire   +6 more sources

Multiplicatively Exact Algorithms for Transformation and Reconstruction of Directed Path-Cycle Graphs with Repeated Edges

Mathematics, 2021
For any weighted directed path-cycle graphs, a and b (referred to as structures), and any equal costs of operations (intermergings and duplication), we obtain an algorithm which, by successively applying these operations to a, outputs b if the first ...
Konstantin Gorbunov, Vassily Lyubetsky
doaj   +1 more source

An Exact Algorithm for Task Allocation of Multiple Unmanned Surface Vehicles with Minimum Task Time

Journal of Marine Science and Engineering, 2021
Task allocation of unmanned surface vehicles (USVs) with low task cost is an important research area which assigns USVs from starting points to different target points to complete tasks.
Kai Xue, Zhiqin Huang, Ping Wang, Zeyu Xu   +3 more
doaj   +1 more source

Exact Algorithms for Intervalizing Colored Graphs [PDF]

Theory of Computing Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bodlaender, Hans L., van Rooij, Johan M M   +1 more
openaire   +6 more sources

Exact Algorithms for Biclique Coloring

Matemática Contemporânea, 2022
Summary: A \(k\)-biclique-coloring of \(G\) is \(k\)-coloring of the vertices of \(G\) with no maximal monochromatic biclique. A recent work showed that determining if such a coloring exists is \(\Sigma_2^{\mathsf{P}}\)-complete for \(k>2\). We present algorithms to determine if a graph has a \(k\)-biclique-coloring: an \(\mathcal{O}^\ast(4^n)\)-time ...
Guilherme Gomes, Carlos Lima, Vinicius dos Santos   +2 more
openaire   +2 more sources

An exact algorithm for the generalized list T-coloring problem [PDF]

Discrete Mathematics & Theoretical Computer Science, 2014
Discrete ...
Konstanty Junosza-Szaniawski, Pawel Rzazewski   +1 more
doaj   +1 more source

Exact Algorithms for Terrain Guarding [PDF]

ACM Transactions on Algorithms, 2018
Given a 1.5-dimensional terrain T , also known as an x -monotone polygonal chain, the T errain G uarding problem seeks a set of points of minimum size on T that guards all of the points on
Ashok, Pradeesha, Fomin, Fedor V., Kolay, Sudeshna, Saurabh, Saket, Zehavi, Meirav   +4 more
openaire   +3 more sources

Linear Time Additively Exact Algorithm for Transformation of Chain-Cycle Graphs for Arbitrary Costs of Deletions and Insertions

Mathematics, 2020
We propose a novel linear time algorithm which, given any directed weighted graphs a and b with vertex degrees 1 or 2, constructs a sequence of operations transforming a into b.
Konstantin Gorbunov, Vassily Lyubetsky
doaj   +1 more source

Exact Local Bosonic Algorithm for Dynamical Quarks [PDF]

, 1996
We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. We show that this algorithm is a viable alternative to the Hybrid Monte Carlo algorithm.Comment: 3 pages, 1 PostScript figure; Talk presented at ...
A. Galli, Alexandrou, Boriçi, Boriçi, Bunk, de Forcrand, Frommer, Jegerlehner, Lüscher, Ph. de Forcrand   +9 more
core   +2 more sources