AC0 - PDFSEARCH.IO - Document Search Engine

AC0
Results: 15

#	Item
1	Candidate Weak Pseudorandom Functions in AC0 ◦ MOD2 Adi Akavia∗ Andrej Bogdanov† Siyao Guo‡ Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2014-05-25 01:37:43
2	Subexponential AC0-Frege Simulates Frege Yuval Filmus1 Toniann Pitassi1 Rahul Santhanam2 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-06-25 19:52:36
3	A simple proof of Bazzi’s theorem ALEXANDER RAZBOROV University of Chicago In 1990, Linial and Nisan asked if any polylog-wise independent distribution fools any function in AC0 . In a recent remarkable development, Ba Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2009-05-05 13:03:32
4	THE SIGN-RANK OF AC0 ∗ ALEXANDER A. RAZBOROV† AND ALEXANDER A. SHERSTOV‡ Abstract. The sign-rank of a matrix A = [Aij ] with ±1 entries is the least rank of a real Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2009-10-01 16:49:01
5	A simple proof of Bazzi’s theorem ALEXANDER RAZBOROV University of Chicago In 1990, Linial and Nisan asked if any polylog-wise independent distribution fools any function in AC0 . In a recent remarkable development, Ba Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2009-05-05 13:03:32
6	A Satisfiability Algorithm for AC0 Russell Impagliazzo ∗ William Matthews Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2013-09-30 22:11:42
7	Majority is Incompressible by AC0[p] Circuits∗ Igor Carboni Oliveira1 and Rahul Santhanam2 1 Department of Computer Science, Columbia University, USA Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-05-27 10:18:38
8	On Randomness Extraction in AC0 Oded Goldreich1 , Emanuele Viola2 , and Avi Wigderson3 1 2 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-05-27 10:18:38
9	Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf, Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-06-22 20:53:40 Logic in computer science Automated theorem proving Frege system Propositional calculus Computational complexity theory Proof complexity Function Gottlob Frege Mathematical proof Mathematics Theoretical computer science Mathematical logic
10	A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-04-05 15:13:04 Computational complexity theory Logic in computer science Mathematical logic Proof theory Automated theorem proving Frege system Proof complexity Function Switching lemma Theoretical computer science Mathematics Logic

UPDATE