Results 121 to 130 of about 11,104 (228)

Fast simulation of planar Clifford circuits [PDF]

open access: yesQuantum
A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally ...
David Gosset   +3 more
doaj   +1 more source

The treewidth of line graphs

open access: yesJournal of Combinatorial Theory, Series B, 2018
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to determining the minimum vertex congestion of an embedding of $G$ into a tree.
Daniel J. Harvey, David R. Wood
openaire   +2 more sources

Causal Unit Selection using Tractable Arithmetic Circuits

open access: yesProceedings of the International Florida Artificial Intelligence Research Society Conference
The unit selection problem aims to find objects, called units, that optimize a causal objective function which describes the objects' behavior in a causal context (e.g., selecting customers who are about to churn but would most likely change their mind ...
Haiying Huang, Adnan Darwiche
doaj   +1 more source

Home - About - Disclaimer - Privacy