Results 11 to 20 of about 892,017 (284)
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 Solving Stochastic Games [PDF]
, 2012 Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration.
Hansen, Kristoffer Arnsfelt +4 more
core +6 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
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. +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 +2 more
openaire +2 more sources
Quantum‐based exact pattern matching algorithms for biological sequences
ETRI Journal, 2021 In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in ON time, whereas quantum algorithm design is based on ...
Kapil Kumar Soni, Akhtar Rasool
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 +4 more
openaire +3 more sources
PERFORMANCE ANALYSIS OF OPTIMIZATION METHODS FOR SOLVING TRAVELING SALESMAN PROBLEM
Сучасний стан наукових досліджень та технологій в промисловості, 2021 The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp). The goal is to find out the gaps of distance and time between two types of optimization methods in traveling salesman problem:
Chandra Agung, Natalia Christine
doaj +1 more source
Algorithms, 2013 We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +1 more source
Exact algorithms for the order picking problem [PDF]
, 2018 Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force.
Cambazard, Hadrien +2 more
core +4 more sources