The following pages link to William I. Gasarch (Q811135):
Displaying 50 items.
- (Q230554) (redirect page) (← links)
- On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
- Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive (Q540051) (← links)
- Frequency computation and bounded queries (Q671360) (← links)
- Characterizing language identification in terms of computable numberings (Q676311) (← links)
- Strong polynomial-time reducibility (Q676314) (← links)
- Automorphisms in the PTIME-Turing degrees of recursive sets (Q676317) (← links)
- Training sequences (Q811136) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case (Q922525) (← links)
- Inferring answers to queries (Q927868) (← links)
- Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Bounded query classes and the difference hierarchy (Q1114678) (← links)
- Nondeterministic bounded query reducibilities (Q1120564) (← links)
- On the relative sizes of learnable sets (Q1128667) (← links)
- On selecting the \(k\) largest with restricted quadratic queries (Q1178226) (← links)
- The Mapmaker's dilemma (Q1182308) (← links)
- On checking versus evaluation of multiple queries (Q1260648) (← links)
- Classification using information (Q1273758) (← links)
- On the finiteness of the recursive chromatic number (Q1295384) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- A generalized insertion algorithm for the seriation problem (Q1328867) (← links)
- An optimal algorithm to compute all the covers of a string (Q1329417) (← links)
- On recursive bounds for the exceptional values in speed-up (Q1334675) (← links)
- The structure of the honest polynomial m-degrees (Q1341316) (← links)
- Binary search and recursive graph problems (Q1391302) (← links)
- When does a random Robin Hood win? (Q1401420) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- Max and min limiters (Q1407552) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Distinct volume subsets via indiscernibles (Q1734275) (← links)
- Terse, superterse, and verbose sets (Q1803657) (← links)
- Bounded queries in recursion theory (Q1806349) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- Automata techniques for query inference machines (Q1849855) (← links)
- Possible degrees in recursive copies (Q1902615) (← links)
- An extended Lachlan splitting theorem (Q1919538) (← links)
- Priority constructions (Q1923576) (← links)
- Recursion theoretic models of learning: Some results and intuitions (Q1924732) (← links)
- Limits on the computational power of random strings (Q1951574) (← links)
- Selection problems via \(m\)-ary queries (Q2366172) (← links)
- A tight lower bound for restricted PIR protocols (Q2506166) (← links)
- (Q2729228) (← links)
- Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems (Q2828234) (← links)
- Limits on the Computational Power of Random Strings (Q3012814) (← links)
- When Can One Load a Set of Dice so That the Sum Is Uniformly Distributed? (Q3153929) (← links)
- (Q3395988) (← links)
- The complexity of learning SUBSEQ(<i>A</i>) (Q3399186) (← links)
- (Q3517634) (← links)