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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 412; no. 41; pp. 5796 - 5801
Main Author:	Drucker, Andrew
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 23.09.2011 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!