Extending NC and RNC algorithms

DOI10.1007/BF01553905zbMath0688.68042MaRDI QIDQ1263974

Nimrod Megiddo

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

circuit complexityparametric problemsprobabilistic circuitspoly-log depth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Finding Least-Distances Lines
• New Results on the Complexity of p-Centre Problems
• An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
• Combinatorial Optimization with Rational Objective Functions

This page was built for publication: Extending NC and RNC algorithms