RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

International Journal of Computational Geometry and Applications - Singapore
doi 10.1142/s021819599200007x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

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
1996English

Area-Time Optimal Division for T = Ω((log N)1 + Ε)

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1987English

An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation

SIAM Journal on Scientific and Statistical Computing
1992English

Constructing O(n Log N) Size Monotone Formulae for the K-Th Elementary Symmetric Polynomial of N Boolean Variables

English

Electrolysis of Ω-Phenyl. Fatty Acidsin N, N-Dimethylformamide

The Journal of the Society of Chemical Industry, Japan
1970English

The Discrete Logarithm Hides $O(\log N)$ Bits

SIAM Journal on Computing
MathematicsComputer Science
1988English

An Ω(n2 Log N) Lower Bound to the Shortest Paths Problem

1977English

An O(log N) Dynamic Router-Table Design

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2004English

Crystal Structure of (Diperchlorato-O,o')(1,4,7,11-Tetraazacyclotetradecane-N,N',N'',N''')copper(II).

Analytical Sciences
Analytical Chemistry
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy