Concept
Réécriture (informatique)
Publications associées (32)
Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time
We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...
Springer2022Black hole metamorphosis and stabilization by memory burden
Systems of enhanced memory capacity are subjected to a universal effect of memory burden, which suppresses their decay. In this paper, we study a prototype model to show that memory burden can be overcome by rewriting stored quantum information from one se ...
AMER PHYSICAL SOC2020SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism
Giovanni De Micheli, Mathias Soeken, Winston Jason Haaswijk
Exact synthesis is a versatile logic synthesis technique with applications to logic optimization, technology mapping, synthesis for emerging technologies, and cryptography. In recent years, advances in SAT solving have lead to a heightened research effort ...
2020Deep Bayesian Trust : A Dominant and Fair Incentive Mechanism for Crowd
An important class of game-theoretic incentive mechanisms for eliciting effort from a crowd are the peer based mechanisms, in which workers are paid by matching their answers with one another. The other classic mechanism is to have the workers solve some g ...
ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2019