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
»
Deterministic Approximate Counting of Depth-2 Circuits
Sort
relevance
views
votes
recent
update
View
thumb
title
115
click to vote
ISTCS
1993
Springer
86
views
Applied Computing
»
more
ISTCS 1993
»
Deterministic Approximate Counting of Depth-2 Circuits
15 years 7 months ago
Download
www.math.ias.edu
Michael Luby, Boban Velickovic, Avi Wigderson
claim paper
Read More »
110
click to vote
CSR
2009
Springer
109
views
Theoretical Computer Science
»
more
CSR 2009
»
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
15 years 9 months ago
Download
drops.dagstuhl.de
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC0 ◦MODm circuits. We show that the following ...
Kristoffer Arnsfelt Hansen
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »