Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

88

COCO
1989
Springer

113views Algorithms» more COCO 1989»

Boolean Functions, Invariance Groups and Parallel Complexity

15 years 7 months ago

Boolean Functions, Invariance Groups and Parallel Complexity

Download clavius.bc.edu

Peter Clote

Real-time Traffic

Algorithms | COCO 1989 |

claim paper

Related Content

» Graph Properties and Circular Functions How Low Can Quantum Query Complexity Go

» On the Sensitivity of CyclicallyInvariant Boolean Functions

» On the Symmetric Property of Homogeneous Boolean Functions

» Complexity of Boolean Functions on PRAMs Lower Bound Techniques

» Key Management for Secure Internet Multicast Using Boolean Function Minimization Technique...

» A Quantum Algorithm for Finding Minimum ExclusiveOr Expressions for MultiOutput Incomplete...

» Linear Systems over Finite Abelian Groups

» Effective Testing and Debugging Techniques for a Group Communication System

» On the shiftability of dualtree complex wavelet transforms

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1989
Where	COCO
Authors	Peter Clote

Comments (0)