Results

eNauka >  Results >  Non-polynomial lower bound for monotone depth-3 circuits computing an NC^1-complete function
Title: Non-polynomial lower bound for monotone depth-3 circuits computing an NC^1-complete function
Authors: D. Živković 
Issue Date: 2006
Publication: International Mathematical Conference, Belgrade, Serbia
Type: Conference Paper
Collation: str. 54-54
URI: http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai/record/1/987
https://enauka.gov.rs/handle/123456789/709923
M-category: 
Mp. category will be shown later

Find the DOI

Google ScholarTM

Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.