This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
Modern unsteady (multi-)field visualizations require an effective reduction of the data to be displayed. From a huge amount of information the most informative parts have to be ext...
Heike Jänicke, Alexander Wiebel, Gerik Scheuerm...
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
The IsaLog model and language are presented. The model has complex objects with classes, relations, and isa hierarchies. The language is strongly typed and declarative. The main i...