Critical Properties and Complexity Measures of Read-Once Boolean Functions

In this paper, we define a quasi-order on the set of read-once Boolean functions and show that this is a well-quasi-order. This implies that every parameter measuring complexity of the functions can be characterized by a finite set of minimal subclasses of read-once functions, where this parameter i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of mathematics and artificial intelligence Ročník 89; číslo 5-6; s. 595 - 614
Hlavní autoři: Lozin, Vadim, Moshkov, Mikhail
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.06.2021
Springer
Springer Nature B.V
Témata:
Artificial Intelligence
Boolean
Boolean functions
Codes
Complex Systems
Complexity
Computer Science
Game theory
Graphs
Mathematics
Measurement
Parameters
Terminology
06E30
Certificate complexity
Well-quasi-ordering
Read-once Boolean function
06A07
ISSN:1012-2443, 1573-7470
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we define a quasi-order on the set of read-once Boolean functions and show that this is a well-quasi-order. This implies that every parameter measuring complexity of the functions can be characterized by a finite set of minimal subclasses of read-once functions, where this parameter is unbounded. We focus on two parameters related to certificate complexity and characterize each of them in the terminology of minimal classes.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1012-2443
1573-7470
DOI:10.1007/s10472-021-09734-6