On the complexity of comparison problems using linear functions
- 1 October 1975
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 85-89
- https://doi.org/10.1109/sfcs.1975.20
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Spira's theorems on complete linear proofs of systems of linear inequalitiesMathematika, 1975
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- On lower bounds for computing the i-th largest elementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- Some results on the effect of arithmetics on comparison problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Complete linear proofs of systems of linear inequalitiesJournal of Computer and System Sciences, 1972
- A sorting problem and its complexityCommunications of the ACM, 1972
- Computing the maximum and the medianPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971