#### Filter Results:

- Full text PDF available (126)

#### Publication Year

1983

2017

- This year (1)
- Last 5 years (54)
- Last 10 years (114)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- William Gasarch
- 2004

e will onsider lter formultion y ghor et lF PQF e model dtse s @IA n nE it string x = x 1 x 2 · · · x n D together with @PA omputtionl gent tht n do omputtions sed on oth x nd queries mde to itF elie wnts to otin x i suh tht the dtse does not lern iF etully elie wnts more thn tht! she wnts the dtse… (More)

- Amihood Amir, Richard Beigel, William I. Gasarch
- Structure in Complexity Theory Conference
- 1990

Consider the function F A k (x 1 ; : : :; x k) = A(x 1) A(x k). We show that if F A k can be computed with less than k queries to some set X then A 2 P=poly. A generalization of this result has applications to bounded query classes, circuits, and enumerability. In particular we obtain the following. (1) Assuming p 3 6 = p 3 the hierarchy of functions… (More)

- William I. Gasarch, Evan Golub, Aravind Srinivasan
- Theor. Comput. Sci.
- 2003

- Lance Fortnow, William I. Gasarch, +7 authors Frank Stephan
- Ann. Pure Appl. Logic
- 1994

- Richard Chang, William I. Gasarch, Carsten Lund
- SIAM J. Comput.
- 1993

This paper investigates the computational complexity of approximating several NP-optimization problems using the number of queries to an NP oracle as a complexity measure. The results show a trade-off between the closeness of the approximation and the number of queries required. For an approximation factor k(n), log log k(n) n queries to an NP oracle can be… (More)

- Richard Beigel, William I. Gasarch
- Ann. Pure Appl. Logic
- 1989

We classify functions in recursive graph theory in terms of how many queries to K (or ∅ ′′ or ∅ ′′′) are required to compute them. We show that (1) binary search is optimal (in terms of the number of queries to K) for finding the chromatic number of a recursive graph and that no set of Turing degree less than 0 ′ will suffice, (2) determining if a recursive… (More)

- William I. Gasarch, Mark W. Krentel, Kevin J. Rappoport
- Mathematical Systems Theory
- 1995

- Richard Beigel, William I. Gasarch, James Glenn
- MFCS
- 2006

Let x 1 ,. .. , x k be n-bit numbers and T ∈ N. Assume that P 1 ,. .. , P k are players such that P i knows all of the numbers except x i. The players want to determine if k j=1 x j = T by broadcasting as few bits as possible. Chandra, Furst, and Lipton obtained an upper bound of O(√ n) bits for the k = 3 case, and a lower bound of ω(1) for k ≥ 3 when T =… (More)

- Richard Beigel, William I. Gasarch
- Discrete Applied Mathematics
- 1991

1) Introduction We examine the problem of coloring part of a k-colorable graph, while not knowing the rest of it. To illustrate some of our concepts, we describe a somewhat whimsical scenario, which we call the Mapmaker's Dilemma. Picture a 12th-century mapmaker who is given a map of Europe and the countries adjacent to Europe, and is told to 4-color the… (More)

- David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky
- SIAM J. Discrete Math.
- 2015

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract. Suppose that a and d are positive integers with a ≥ 2. Let h a,d… (More)