Daniel Apon

3,382 reputation

11434

bio	website
	location	College Park, MD
	age	27
visits	member for	2 years, 10 months
	seen	15 hours ago
stats	profile views	681

Currently, I am a PhD student in CS Theory at the Univ of MD-College Park since Fall 2011, advised by Jonathan Katz. I previously completed a MS in CS at the Univ of AR under Wing-ning Li, and a Bachelor's in Business at the Univ of AR, Walton School of Business.

Research Interests:

Lattice-based Cryptography
Concrete Complexity (e.g. Communication Complexity, Resolution, etc.)
Computational Complexity

An area I've worked on, from this site: Grid $k$-coloring without monochromatic rectangles

	3,382 reputation	bio	website		visits	member for	2 years, 10 months
11434 badges		location	College Park, MD		seen	15 hours ago

summary answers questions tags badges favorites bounties reputation activity

37 Answers

votes activity newest

43	What papers should everyone read?
40	Major unsolved problems in theoretical computer science?
28	What are good references to understanding the proof of the PCP theorem?
24	Hierarchies in NP (under the assumption that P != NP)
23	Ways for a mathematician to stay informed of current research in complexity theory

3,382 Reputation

+10	Can strong NP-hardness really be shown using plain polytime reductions?
+10	Finding short and fat paths
+5	Communication Complexity …Classes?
-2	Find the remainder of a large fixed polynomial when divided by a small unknown polynomial

11 Questions

votes activity newest

35	Grid $k$-coloring without monochromatic rectangles
16	UGC hardness of the predicate $NAE(x_1, …, x_\ell)$ for $x_i \in GF(k)$?
16	Choosing a research topic using game theory
15	Communication Complexity …Classes?
14	Succinct circuit representation of graphs

60 Tags

169 cc.complexity-theory × 24	28 pcp
50 soft-question × 7	27 np-hardness × 3
44 reference-request × 5	20 advice-request
43 research-practice × 2	18 ds.algorithms × 8
28 complexity-classes × 6	17 unique-games-conjecture × 3