Publication

Canonical Computation without Canonical Representation

Mathias Soeken, Luca Gaetano Amarù, Ana Petkovska
2018
Conference Papers

Abstract

A representation of a Boolean function is canonical if, given a variable order, only one instance of the representation is possible for the function. A computation is canonical if the result depends only on the Boolean function and a variable order, and does not depend on how the function is represented and how the computation is implemented.

Official source

https://infoscience.epfl.ch/entities/publication/6c509b6a-198d-4efa-bef2-4b29832608fa

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Canonical Computation without Canonical Representation

Chat with Graph Search

Koopman-based Data-driven Robust Control of Nonlinear Systems Using Integral Quadratic Constraints

Extensions of Peer Prediction Incentive Mechanisms

Graph generative deep learning models with an application to circuit topologies