Results 11 to 20 of about 2,188,345 (345)
A Polynomial-Time Algorithm for Pliable Index Coding [PDF]
IEEE Transactions on Information Theory, 2016 In pliable index coding, we consider a server with $m$ messages and $n$ clients where each client has as side information a subset of the messages. We seek to minimize the number of broadcast transmissions, so that each client can recover any one unknown message she does not already have. Previous work has shown that the pliable index coding problem is
Linqi Song, Christina Fragouli
openaire +4 more sources
Polynomial-Time Algorithm for Learning Optimal BFS-Consistent Dynamic Bayesian Networks [PDF]
Entropy, 2018 Dynamic Bayesian networks (DBN) are powerful probabilistic representations that model stochastic processes. They consist of a prior network, representing the distribution over the initial variables, and a set of transition networks, representing the ...
Margarida Sousa, Alexandra M. Carvalho
doaj +2 more sources
A Polynomial Time Algorithm for 3SAT
CoRRIt is shown that any two clauses in an instance of 3SAT sharing the same terminal which is positive in one clause and negated in the other can imply a new clause composed of the remaining terms from both clauses. Clauses can also imply other clauses as long as all the terms in the implying clauses exist in the implied clause. It is shown an instance of
R. Quigley
semanticscholar +5 more sources
A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits
Physical Review XWe provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational ...
Thomas Schuster +3 more
doaj +2 more sources
Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time [PDF]
International Symposium on Mathematical Foundations of Computer Science, 2019 Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time algorithm solving parity games. After this breakthrough result, a few other quasi-polynomial-time algorithms were introduced; none of them is easy to understand. Moreover,
P. Parys
semanticscholar +2 more sources
Polynomial time algorithm for solving cyclic games [PDF]
Computer Science Journal of Moldova, 2003 The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.
Dmitrii Lozovanu
doaj +1 more source
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling [PDF]
Symposium on the Theory of Computing, 2022 We give a polynomial time classical algorithm for sampling from the output distribution of a noisy random quantum circuit in the regime of anti-concentration to within inverse polynomial total variation distance.
D. Aharonov +4 more
semanticscholar +1 more source
Learning Quantum Hamiltonians at Any Temperature in Polynomial Time [PDF]
Symposium on the Theory of Computing, 2023 We study the problem of learning a local quantum Hamiltonian H given copies of its Gibbs state ρ = e−β H/(e−β H) at a known inverse temperature β>0. Anshu, Arunachalam, Kuwahara, and Soleimanifar gave an algorithm to learn a Hamiltonian on n qubits to ...
Ainesh Bakshi +3 more
semanticscholar +1 more source
A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem
ACM-SIAM Symposium on Discrete Algorithms, 2021 The disjoint paths problem is a fundamental problem in algorithmic graph theory and combinatorial optimization. For a given graph G and a set of k pairs of terminals in G , it asks for the existence of k vertex-disjoint paths connecting each pair of ...
William Lochet
semanticscholar +1 more source
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation [PDF]
Operations Research Letters, 2019 We consider fair allocation of indivisible items under additive utilities. When the utilities can be negative, the existence and complexity of an allocation that satisfies Pareto optimality and proportionality up to one item (PROP1) is an open problem ...
H. Aziz, H. Moulin, Fedor Sandomirskiy
semanticscholar +1 more source