[go: up one dir, main page]

login
Revision History for A109455 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of equivalence classes of threshold functions under permutations of the variables.
(history; published version)
#8 by Jon E. Schoenfield at Sun Aug 09 00:00:46 EDT 2015
STATUS

editing

approved

#7 by Jon E. Schoenfield at Sun Aug 09 00:00:44 EDT 2015
AUTHOR

D. E. _Don Knuth, _, Aug 17 2005

STATUS

approved

editing

#6 by N. J. A. Sloane at Sun Sep 04 15:40:40 EDT 2011
STATUS

editing

approved

#5 by N. J. A. Sloane at Sun Sep 04 15:40:35 EDT 2011
REFERENCES

D. E. Knuth, The Art of Computer Programming, Vol. 4, 4A, Section 7.1.1 (in preparation), p. 79.

STATUS

approved

editing

#4 by Joerg Arndt at Fri Apr 22 06:49:47 EDT 2011
STATUS

proposed

approved

#3 by Joerg Arndt at Fri Apr 22 06:46:45 EDT 2011
KEYWORD

nonn,hard,more

STATUS

approved

proposed

#2 by N. J. A. Sloane at Sat Nov 10 03:00:00 EST 2007
REFERENCES

Donald D. E. Knuth, The Art of Computer Programming, Vol. 4, Section 7.1.1 (in preparation).

KEYWORD

nonn,new

nonn

AUTHOR

Don D. E. Knuth, Aug 17 2005

#1 by N. J. A. Sloane at Wed Sep 21 03:00:00 EDT 2005
NAME

Number of equivalence classes of threshold functions under permutations of the variables.

DATA

2, 4, 10, 34, 178, 1720, 590440

OFFSET

0,1

REFERENCES

Donald E. Knuth, The Art of Computer Programming, Vol. 4, Section 7.1.1 (in preparation).

S. Muroga, Threshold Logic and Its Applications. Wiley, NY, 1971. [Background]

CROSSREFS
KEYWORD

nonn

AUTHOR

Don Knuth, Aug 17 2005

STATUS

approved