user avatar
user avatar
user avatar
William Hoza
  • Member for 7 years
  • Last seen more than a week ago
11 votes
Accepted

On sparse complete sets and P vs L

11 votes
Accepted

Is $UL\neq PSPACE$ known?

11 votes

$RL=L$ Progress Since 2006

10 votes

What are examples of how non-uniformity can be useful?

9 votes
Accepted

What are the consequences of $P \subseteq L/poly$?

9 votes

Canonical representation of Binary Decision Tree in Ptime?

7 votes
Accepted

Does the space hierarchy theorem generalize to non-uniform computation?

6 votes

Complexity of simple undirected graph isomorphism problem

5 votes
Accepted

What's the proof of this lemma by Hajnal about the randomized query complexity of monotone graph properties?

4 votes

P-complete decision problems about integers

4 votes
Accepted

"Parity testing set" for disjoint pairs of sets

3 votes

Smallest $f(n)$ such that $P/f(n) = BPP/f(n)$?

3 votes

What are semantic classes that have a syntactic equivalent?

3 votes

The power of randomized logspace with two-way access to the random tape

3 votes
Accepted

Is this a weaker or stronger form of the halting problem

2 votes
Accepted

Question on deduction that a certain problem requires exponential space

2 votes

Family of functions with properties similar to k-wise independent hash functions

1 vote

"Any" Subset Sum. Is it hard?

0 votes

Is there a typo in this definition of Minimal Maximal Matching