Andy's Math/CS page

Sporadic notes on mathematical and non-mathematical topics, from a student of computational complexity.

Saturday, October 18, 2014

Making academic contacts (some thoughts for new researchers)

›
Suppose you're an undergraduate hoping to go into academic research, or a beginning grad student.  It could be very helpful to have acad...
6 comments:
Wednesday, September 28, 2011

A geometric-graphs offering

›
Introduction After a night of board games, I found myself thinking about the peculiarities of movement on discrete versions of the plane. Th...
5 comments:
Wednesday, June 15, 2011

Joint computational complexity, and the "buy-one-get-one-free conjecture"

›
Below is a simple-to-state open question, stemming from this paper of mine from CCC'09. First, I'll state the question; then I'...
7 comments:
Monday, May 09, 2011

An exciting new textbook, and a request

›
Today I'd like to put out an appeal to readers. If you have a solid grasp of English and an interest in circuit complexity (no expertis...
6 comments:
Friday, December 10, 2010

Harassment Policies for Theory Conferences

›
Following offline conversations and recent discussions on other blogs (hat-tip to Anna and David ), I want to promote the Geek Feminism Blo...
14 comments:
Thursday, November 04, 2010

ECCC: what authors should know

›
Anyone interested in computational complexity should be aware of ECCC , the most important and widely-used online repository for complexity ...
18 comments:
Wednesday, July 21, 2010

Injective polynomials

›
From a paper of MIT's Bjorn Poonen , I learned of an amazingly simple open problem. I'll just quote the paper (here Q denotes the...
11 comments:
›
Home
View web version

About Me

Andy D
Originally from Berkeley, CA, I earned a PhD at MIT and am currently a postdoc at U. Edinburgh. My homepage
View my complete profile
Powered by Blogger.