Back to Results
First PageMeta Content
Order theory / Computational complexity theory / Functional analysis / Monotonic function / Real analysis / Circuit complexity / Aanderaa–Karp–Rosenberg conjecture / Clique problem / Mathematics / Mathematical analysis / Theoretical computer science


Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus∗∗ Toniann Pitassi∗† Robert Robere∗‡
Add to Reading List

Document Date: 2014-02-13 16:02:33


Open Document

File Size: 407,85 KB

Share Result on Facebook

/

Event

Product Recall / Product Issues / /

Facility

University of Toronto / /

IndustryTerm

non-monotone switching networks / sound monotone switching network / inner product / non-monotone switching network / matrix-cut algorithms / monotone switching network / rectifier network / monotone switching networks / computing / monotone circuit computing / computation models extending monotone switching networks / search problems / /

Organization

Department of Computer Science / University of Toronto / /

Person

Robert Robere∗‡ Stephen / Toniann Pitassi∗† Robert / Such / Proposition / Stephen A. Cook / /

Position

vP in the switching network / Rt / state vP / General / /

Product

Theorem / /

ProgrammingLanguage

L / C / /

ProvinceOrState

North Carolina / /

Technology

cryptography / matrix-cut algorithms / /

SocialTag