A degree-decreasing lemma for circuits.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)
- Volume: 4, Issue: 2, page 247-254 p.
- ISSN: 1365-8050
Access Full Article
top
How to cite
topGrolmusz, Vince. "A degree-decreasing lemma for circuits.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 247-254 p.. <http://eudml.org/doc/121862>.
@article{Grolmusz2001,
author = {Grolmusz, Vince},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {circuit complexity},
language = {eng},
number = {2},
pages = {247-254 p.},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {A degree-decreasing lemma for circuits.},
url = {http://eudml.org/doc/121862},
volume = {4},
year = {2001},
}
TY - JOUR
AU - Grolmusz, Vince
TI - A degree-decreasing lemma for circuits.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2001
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 4
IS - 2
SP - 247
EP - 254 p.
LA - eng
KW - circuit complexity
UR - http://eudml.org/doc/121862
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.