Partitioning Arrangements of Lines I: An Efficient Deterministic Algorithm

Discrete and Computational Geometry- United States

doi 10.1007/bf02187805

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

An Efficient Fully Symbolic Bisimulation Algorithm for Non-Deterministic Systems

International Journal of Foundations of Computer Science
Computer Science
2013English

An Efficient Clustering Algorithm for Partitioning Y-Short Tandem Repeats Data

BMC Research Notes
BiochemistryMedicineGeneticsMolecular Biology
2012English

Usort: An Efficient Hybrid of Distributive Partitioning Sorting

BIT Numerical Mathematics
Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications
1982English

An Efficient Grouping Genetic Algorithm

International Journal of Computer Applications
2011Dutch

An Efficient Multipath Routing Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

An Improved Genetic Algorithm for Developing Deterministic OTP Key Generator

Complexity
MultidisciplinaryComputer Science
2017Danish

An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

An Efficient FPGA Implementation of AES Algorithm

International Journal of Engineering Research and
2016English

An Efficient and Provably Correct Algorithm for the Multiscale Estimation of Image Contours by Means of Polygonal Lines

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy