How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald H...
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
Abstract. If co-operating government agencies reside in different countries, they will differ in many respects: administrative ontologies and laws, political context, administrativ...
Prioritizing requirements can play a significant role in reducing requirement problems and increasing customer satisfaction. This paper describes our experiences in teaching requi...
dimension of abstraction and specificity, and they may mix both top-level goals and subgoals when describing what they want a plan to do. We show how the Prodigy planning system h...