FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...