Block sensitivity of minterm-transitive functions

Boolean functions with a high degree of symmetry are interesting from a complexity theory perspective: extensive research has shown that these functions, if nonconstant, must have high complexity according to various measures. In a recent work of this type, Sun (2007) [9] gave lower bounds on the bl...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 412; číslo 41; s. 5796 - 5801
Hlavní autor:	Drucker, Andrew
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 23.09.2011 Elsevier
Témata:	Applied sciences Block sensitivity Blocking Boolean functions Calculus of variations and optimal control Combinatorics. Ordered structures Complexity theory Computer science; control theory; systems Exact sciences and technology Group theory Group theory and generalizations Invariants Mathematical analysis Mathematical models Mathematics Minterm-transitive functions Miscellaneous Order, lattices, ordered algebraic structures Permutations Sciences and techniques of general use Sun Theoretical computing Transitively invariant functions Weakly symmetric functions Minterm-transitive functions Weakly symmetric functions Boolean functions Block sensitivity Transitively invariant functions Lower bound Invariant Computer theory Boolean function Symmetric function Complexity measure Research Transitive group Permutation group Symmetry
ISSN:	0304-3975, 1879-2294
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!

Buďte první, kdo okomentuje tento záznam!