Small-dimensional linear programming and convex hulls made easy
نویسندگان
چکیده
منابع مشابه
Small-Dimensional Linear Programming and Convex Hulls Made Easy
We present two randomized algorithms. One solves linear programs involving m constraints in d variables in expected time O(m). The other constructs convex hulls of n points in Nd, d > 3, in expected time O(nln/2l). In both bounds d is considered to be a constant. In the linear programming algorithm the dependence of the time bound on d is of the form d!. The main virtue of our results lies in t...
متن کاملConcurrent Programming Made Easy
The task of programming concurrent systems is substantially more difficult than the task of programming sequential systems with respect to both correctness and efficiency. In this paper we describe a constraint-based methodology for writing concurrent applications. A system is modeled as: (a) a set of processes containing a sequence of “markers” denoting the processes points of interest; and (b...
متن کاملQuantum programming made easy
We introduce the functional language IQu (“Haiku”) which, under the paradigm “quantum data & classical control” and in accordance with the model QRAM, allows to define and manipulate quantum circuits also by means of intermediate and partial measurement. Idealized Algol is the reference for the design of IQu. We extend the type system of Idealized Algol for typing both quantum-registers, i.e. t...
متن کاملSCOOP: Concurrent Programming Made Easy
The SCOOP model (Simple Concurrent Object-Oriented Programming) provides a simple yet very powerful mechanism for parallel computation. The model takes advantage of the inherent concurrency implicit in object-oriented programming to provide programmers with a simple extension enabling them to produce parallel applications with little more effort than sequential ones. SCOOP is applicable to many...
متن کاملProgramming Sensor Networks Made Easy
The designer of a sensor network protocol needs to address several low-level details such as message collisions, message losses, and resource limitations. Also, the designer needs to solve several high-level problems such as routing, leader election, and diffusing computation that are already considered in distributed systems and traditional networking. Therefore, to simplify the design of sens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1991
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02574699