In our thesis we cosidered the complexity of the monotonicity checking problem: given a finite poset and an unknown real-valued function on it find out whether this function is monotone. Two decision models were considered: the comparison model, where the queries are usual comparisons, and the linear model, where the queries are comparisons of linear combinations of the input. This is a report on our results.
KeywordsComparison Model Hasse Diagram Boolean Lattice Cover Graph IEEE 16th Annual Symposium
Unable to display preview. Download preview PDF.
- 1.Aigner, M.: Combinatorial Search. Wiley-Teubner Series in Computer Science, Stuttgart (1988)Google Scholar
- 2.Geissinger, L.: A polytope associated to a finite ordered set (preprint)Google Scholar
- 3.Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing monotonicity. Combinatorica, 301–337 (2000)Google Scholar
- 4.Kyureghyan, M.: Monotonicity checking, PhD Thesis, Universität Bielefeld, Bielefeld (2004)Google Scholar
- 7.Voronenko, A.: On the complexity of recognizing monotonicity. Mathematical problems in cybernetics, No. 8 (Russian), Mat. Vopr. Kibern. 8, 301–303 (1999)Google Scholar
- 9.Yao, A.: On the complexity of comparison problems using linear decision trees. In: Proc. IEEE 16th Annual Symposium on foundations of Computer Science, pp. 85–89 (1975)Google Scholar