21st Annual Symposium on Foundations of Computerâ€¦

1980

We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages are universally easyâ€¦ (More)

An Inexact Agreement protocol allows processors that each have a value approximating vÌ‚ to compute new values that are closer to each other and close to vÌ‚ . Two faulttolerant protocols for Inexactâ€¦ (More)

19th Annual Symposium on Foundations of Computerâ€¦

1978

One-way log-tape (1-L) reductions are mappings defined by log-tape Turing machines whose read head on the input can only move to the right. The 1-L reductions provide a more refined tool for studyingâ€¦ (More)

We study the problems of counting and random generation of strings of a fixed length in regular languages. The regular language is described by a non-deterministic finite automaton or regularâ€¦ (More)

27th Annual Symposium on Foundations of Computerâ€¦

1986

An m-degree is a collection of sets equivalent under polynomial-time many-one (Karp) reductions; for example, the complete sets for NP or PSPACE are m-degrees. An m-degree is collapsing iff itsâ€¦ (More)

A quasi-polynomial-time algorithm is presented for sampling almost uniformly at random from the n-slice of the language L(G) generated by an arbitrary context-free grammar G. (The n-slice of aâ€¦ (More)