Amanote Research
Register
Sign In
Constructing O(n Log N) Size Monotone Formulae for the K-Th Elementary Symmetric Polynomial of N Boolean Variables
doi 10.1109/sfcs.1984.715953
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
J. Friedman
Publisher
IEEE
Related search
An O(N Log N) Algorithm for Shape Modeling.
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
International Journal of Computational Geometry and Applications
Geometry
Applied Mathematics
Computational Theory
Computational Mathematics
Mathematics
Theoretical Computer Science
Topology
On the Software Computation of the Formulae for the N-Th Prime Number
Notes on Number Theory and Discrete Mathematics
Constructing a Balanced, (Log(N)/Loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems
An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation
SIAM Journal on Scientific and Statistical Computing
Upper Bounds for K-Th Coset Representatives Modulo N
Acta Arithmetica
Number Theory
Algebra
A O(d) · Polylog N Monotonicity Tester for Boolean Functions Over the Hypergrid [N]d
The Discrete Logarithm Hides $O(\log N)$ Bits
SIAM Journal on Computing
Mathematics
Computer Science
Asymmetric K-Center Is Log* N-Hard to Approximate
Journal of the ACM
Control
Systems Engineering
Information Systems
Hardware
Architecture
Artificial Intelligence
Software
