Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

unweighted threshold gate

biblio

Visible to the public Addition is Exponentially Harder Than Counting for Shallow Monotone Circuits

Submitted by grigby1 on Thu, 08/23/2018 - 11:49am
  • Compositionality
  • pubcrawl
  • composability
  • circuit complexity
  • monotone circuit
  • unweighted threshold gate
  • weighted threshold function
  • Computing Theory

Terms of Use  |  ©2023. CPS-VO