Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Separating the Communication Complexities of MOD m and MOD p...
Sort
relevance
views
votes
recent
update
View
thumb
title
99
click to vote
FOCS
1992
IEEE
94
views
Theoretical Computer Science
»
more
FOCS 1992
»
Separating the Communication Complexities of MOD m and MOD p Circuits
15 years 6 months ago
Download
www.cs.elte.hu
: We prove in this paper that it is much harder to evaluate depth
Vince Grolmusz
claim paper
Read More »
121
click to vote
CJTCS
1999
133
views
more
CJTCS 1999
»
The Permanent Requires Large Uniform Threshold Circuits
15 years 2 months ago
Download
www.cs.rutgers.edu
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »