Monotonicity checking

Authors:
M. Kyureghyan
Affiliations:
-
Venue:
General Theory of Information Transfer and Combinatorics
Year:
2006

Citing 4
Cited 0

Two poset polytopes

Discrete & Computational Geometry
Combinatorial search

Combinatorial search
New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming

Proceedings of the Mathematical Foundations of Computer Science 1984
On the complexity of comparison problems using linear functions

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.