It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a onesided error that is bounded away from 1; and also that 2 queries do not ...
Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, L...
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
Abstract. General methods of investigating effectivity on regular Hausdorff (T3) spaces is considered. It is shown that there exists a functor from a category of T3 spaces into a c...
A methodology is proposed for the formal development of software systems from a user's requirements specification in natural language into a complete implementation, proceedi...
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
Introductory computer science classes are known for having a high attrition rate. Some authors believe this is due to students’ difficulties in establishing a mental model of co...
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
The integration of alias analysis with type information increases the precision of alias detection, especially for inheritance among classes. This paper presents a compile-time fl...
We propose an effective methodology in which a distributed garbage collector may be derived from a distributed termination algorithm and a centralized garbage collector in a manne...
Stephen M. Blackburn, J. Eliot B. Moss, Richard L....
Most search systems for querying large document collections---for example, web search engines---are based on well-understood information retrieval principles