ACC0 - PDFSEARCH.IO - Document Search Engine

ACC0
Results: 57

#	Item
1	Comput. complex), 1 – 010001–20 $ 1.50c Birkh¨ auser Verlag, Basel 1999 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2006-11-08 13:10:36 Circuit complexity Computational complexity theory ACC0 Circuit Bipartite graph
2	Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125. Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-05-08 17:50:59 Complexity classes Computational complexity theory Advice PP P/poly ArthurMerlin protocol Pseudorandom generator Randomized algorithm NP IP Extractor ACC0
3	DATA UPDATE // JULYNOVEMBER 2012 Index Value as at 30-Jun-16 Add to Reading List Source URL: www.7im.co.uk Language: English - Date: 2016-07-07 10:43:36 MSCI Investment Index Frontier markets London Stock Exchange IBoxx Bond market index ACC0
4	On Derandomization and Average-Case Complexity of Monotone Functions ∗ George Karakostas † Add to Reading List Source URL: www.cas.mcmaster.ca Language: English - Date: 2013-12-01 18:41:47 Circuit complexity Pseudorandomness Order theory Computational complexity theory Monotonic function Pseudorandom generator Parity function Monotone ACC0
5	LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1 Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2010-09-09 14:03:27 Computational complexity theory Theory of computation Theoretical computer science Circuit complexity Complexity classes Logic in computer science Clique problem Boolean circuit Clique Circuit ACC0 NC
6	LEARNING LARGE-ALPHABET AND ANALOG CIRCUITS WITH VALUE INJECTION QUERIES Dana Angluin1 James Aspnes1 Jiang Chen2 Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2010-09-09 14:03:20 Computational complexity theory Theory of computation Theoretical computer science Circuit complexity Complexity classes Clique problem Boolean circuit ACC0 Clique Circuit NC
7	Dana Angluin1, James Aspnes1, Jiang Chen2, David Eisenstat, Lev Reyzin1 1Yale University 2Yahoo! Inc. COLT 2008 Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2010-09-09 14:03:21 Computational complexity theory Theory of computation Theoretical computer science Circuit complexity Complexity classes Boolean circuit NC PP ACC0 Circuit FO
8	PDF Document Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2014-03-05 21:08:38 Theory of computation Theoretical computer science Computational complexity theory Computing Communication Communication complexity Quantum complexity theory Quantum information science Pointer Communications protocol ACC0 Transmission Control Protocol
9	BRICS RS-05-9 Frandsen & Miltersen: Reviewing Bounds on the Circuit Size of the Hardest Functions BRICS Basic Research in Computer Science Add to Reading List Source URL: www.brics.dk Language: English - Date: 2005-03-21 06:33:41 Circuit complexity Complexity classes Mathematical notation Computational complexity theory Stack Boolean circuit Summation NC ACC0 Theoretical computer science Mathematics Applied mathematics
10	BRICS Basic Research in Computer Science BRICS DS-97-3 T. Husfeldt: Dynamic Computation Add to Reading List Source URL: www.brics.dk Language: English - Date: 1998-01-16 09:45:05 Complexity classes Algorithm Mathematical logic Model of computation PP Dynamic problem P ACC0 Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE