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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
9
click to vote
ISTCS
1993
Springer
86
views
Applied Computing
»
more
ISTCS 1993
»
Deterministic Approximate Counting of Depth-2 Circuits
13 years 10 months ago
Download
www.math.ias.edu
Michael Luby, Boban Velickovic, Avi Wigderson
claim paper
Read More »
16
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
14 years 24 days 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 »