Find link

language:

Find link is a tool written by Edward Betts.

searching for Electronic Colloquium on Computational Complexity 10 found (17 total)

alternate case: electronic Colloquium on Computational Complexity

Propositional proof system (1,121 words) [view diff] exact match in snippet view article find links to article

past, present and future. Technical Report TR98-067, Electronic Colloquium on Computational Complexity. Nathan Segerlind (2007) "The Complexity of Propositional

Mike Paterson (654 words) [view diff] exact match in snippet view article find links to article

counting homomorphisms to directed acyclic graphs, Electronic Colloquium on Computational Complexity, Report TR05-121, Oct 2005. L.A. Goldberg, M. Jalsenius

QMA (1,832 words) [view diff] exact match in snippet view article find links to article

(2003). "QMA = PP implies that PP contains PH". Electronic Colloquium on Computational Complexity. Gharibian, Sevag; Yirka, Justin (2019). "The complexity

Graph bandwidth (1,519 words) [view diff] exact match in snippet view article find links to article

Algorithm for the Bandwidth Problem on Dense Graphs". Electronic Colloquium on Computational Complexity. 4 (17). Minimum bandwidth problem, in: Pierluigi

Christoph Meinel (1,461 words) [view diff] exact match in snippet view article find links to article

of the online journal on complexity theory ECCC – Electronic Colloquium on Computational Complexity and its editor-in-chief until 2016. Many lectures

Average-case complexity (2,834 words) [view diff] exact match in snippet view article find links to article

average-case complexity," Technical Report TR97-058, Electronic Colloquium on Computational Complexity, 1997. J. Katz and Y. Lindell, Introduction to Modern

Decision tree model (3,229 words) [view diff] exact match in snippet view article find links to article

R. and Tal, A. On Fractional Block Sensitivity. Electronic Colloquium on Computational Complexity (ECCC). Vol. 20. 2013. Ambainis, Andris; Balodis,

Concentration inequality (3,130 words) [view diff] exact match in snippet view article find links to article

(2018). "Anti-concentration in most directions". Electronic Colloquium on Computational Complexity. Sherstov, Alexander A. (2012). "The Communication

Computational complexity of matrix multiplication (4,286 words) [view diff] exact match in snippet view article find links to article

2011). "On Sunflowers and Matrix Multiplication". Electronic Colloquium on Computational Complexity. TR11-067. Raz, Ran (2002). "On the complexity of

Quantum computational chemistry (3,351 words) [view diff] exact match in snippet view article find links to article

measurements and the Abelian Stabilizer Problem (Report). Electronic Colloquium on Computational Complexity (ECCC). Abrams, Daniel S.; Lloyd, Seth (1999-12-13)