No Efficient Disjunction or Conjunction of Switch-Lists

03/09/2022
by   Stefan Mengel, et al.
0

It is shown that disjunction of two switch-lists can blow up the representation size exponentially. Since switch-lists can be negated without any increase in size, this shows that conjunction of switch-lists also leads to an exponential blow-up in general.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2018

When You Should Use Lists in Haskell (Mostly, You Should Not)

We comment on the over-use of lists in functional programming. With this...
research
10/19/2020

Optimal Decision Lists using SAT

Decision lists are one of the most easily explainable machine learning m...
research
11/15/2010

Prize insights in probability, and one goat of a recycled error: Jason Rosenhouse's The Monty Hall Problem

The Monty Hall problem is the TV game scenario where you, the contestant...
research
01/06/2017

SOI RF Switch for Wireless Sensor Network

The objective of this research was to design a 0-5 GHz RF SOI switch, wi...
research
04/11/2022

External control of a genetic toggle switch via Reinforcement Learning

We investigate the problem of using a learning-based strategy to stabili...
research
04/08/2021

Permutation Encoding for Text Steganography: A Short Tutorial

We explore a method of encoding secret messages using factoradic numberi...
research
01/27/2021

Deriving monadic quicksort (Declarative Pearl)

To demonstrate derivation of monadic programs, we present a specificatio...

Please sign up or login with your details

Forgot password? Click here to reset