ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

First Page		Document Content
Date: 2001-10-25 12:45:35 Computational complexity theory Theory of computation Complexity classes Structural complexity theory Conjectures Probability distributions NP Polynomial hierarchy IP P versus NP problem PP P		ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz Add to Reading List Source URL: cs-www.cs.yale.edu Download Document from Source Website File Size: 281,67 KB Share Document on Facebook

	Introduction The Weil conjectures Threefolds Fourfolds Cubic hypersurfaces over finite fields DocID: 1xV7r - View Document
	PERCOLATION AND COARSE CONFORMAL UNIFORMIZATION ITAI BENJAMINI Abstract. We formulate conjectures regarding percolation on planar triangulations suggested by assuming (quasi) invariance under coarse conformal uniformizat DocID: 1xTuk - View Document
	Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–260) PERFECTOID SPACES AND THE HOMOLOGICAL CONJECTURES Yves André DocID: 1xT5f - View Document
	Two Conjectures on Rendezvous in K3 Steve Alpern and Shmuel Gal September 2006 LSE-CDAMThe symmetric rendezvous problem on the triangle K3 asks how two players, initially randomly placed at distinct vertices, ca DocID: 1uSjf - View Document
	Polarizations and Grothendieck’s Standard Conjectures J.S. Milne March 26, 2001; August 14, 2001. Abstract. We prove that Grothendieck’s Hodge standard conjecture holds for abelian varieties in arbitrary characterist DocID: 1uIr1 - View Document