منابع مشابه
Are Concurrent Programs That Are Easier to Write Also Easier to Check?
This quote expresses the importance of choosing the right vocabulary to describe and reason about a concept. There is a long and rich history of language proposals for concurrency: semaphores, locks, wait-and-notify, monitors, conditional critical regions, rendezvous, message passing, and transactional memory. Which of these, if any, forms a good vocabulary? What criteria should one apply? My t...
متن کاملAre Lower Bounds Easier over the Reals ? Ecole Normale Supérieure De Lyon Are Lower Bounds Easier over the Reals ? Are Lower Bounds Easier over the Reals ?
We show that proving lower bounds in algebraic models of computa tion may not be easier than in the standard Turing machine model For instance a superpolynomial lower bound on the size of an alge braic circuit solving the real knapsack problem or on the running time of a real Turing machine would imply a separation of P from PSPACE A more general result relates parallel complexity classes in bo...
متن کاملLanguages that Are Easier than their Proofs
A basic question about NP is whether or not search reduces in polynomial time to decision. We indicate that the answer is negative: under a complexity assumption (that deterministic and nondeterministic double-exponential time are unequal) we construct a language in NP for which search does not reduce to decision. These ideas extend in a natural way to interactive proofs and program checking. U...
متن کاملRing Networks Are Easier to Verify ? (report)
We show in this paper how the ring topology makes easier the analysis of communicating nite state machines' reachability set. We prove that the analysis of this kind of systems can be reduced to the analysis of a single automaton with a single queue. This leads us, by the use of new symbolic transitions, to the proposal of two semi-algorithms, one for normal ring networks and one for lossy ring...
متن کاملTwo Correspondence Problems Easier Than One
Computer vision research rarely makes use of symmetry in stereo reconstruction despite its established importance in perceptual psychology. Such stereo reconstructions produce visually satisfying figures with precisely located points and lines, even when input images have low or moderate resolution. However, because few invariants exist, there are no known general approaches to solving symmetry...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2016
ISSN: 0003-889X,1420-8938
DOI: 10.1007/s00013-016-0953-8