Results 101 to 110 of about 1,532 (205)
Fast simulation of planar Clifford circuits [PDF]
QuantumA 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
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation [PDF]
, 2018 Michał Ziobro, Marcin Pilipczuk
openalex +1 more source
Redicolouring digraphs: directed treewidth and cycle-degeneracy [PDF]
, 2023 Nicolas Nisse +2 more
openalex +1 more source
Causal Unit Selection using Tractable Arithmetic Circuits
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceThe 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
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds [PDF]
, 2021 Jacob Focke +2 more
openalex +1 more source
Hitting minors on bounded treewidth graphs. III. Lower bounds [PDF]
, 2021 Julien Baste +2 more
openalex +1 more source
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size
, 2023 Bart M. P. Jansen +2 more
openalex +2 more sources
Planar Disjoint Paths, Treewidth, and Kernels [PDF]
, 2023 Michał Włodarczyk, Meirav Zehavi
openalex +1 more source
Time-dependent shortest paths in bounded treewidth graphs [PDF]
, 2017 Glencora Borradaile, Morgan Shirley
openalex +1 more source
Attractor detection and enumeration algorithms for Boolean networks. [PDF]
Comput Struct Biotechnol J, 2022 Mori T, Akutsu T.
europepmc +1 more source