Non-commutative arithmetic circuits with division
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F15%3A00453141" target="_blank" >RIV/67985840:_____/15:00453141 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4086/toc.2015.v011a014" target="_blank" >http://dx.doi.org/10.4086/toc.2015.v011a014</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4086/toc.2015.v011a014" target="_blank" >10.4086/toc.2015.v011a014</a>
Alternative languages
Result language
angličtina
Original language name
Non-commutative arithmetic circuits with division
Original language description
The paper ivestigates the complexity of arithmetic circuits with division gates over non-commuting variables.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theory of Computing
ISSN
1557-2862
e-ISSN
—
Volume of the periodical
11
Issue of the periodical within the volume
Article 14
Country of publishing house
US - UNITED STATES
Number of pages
38
Pages from-to
357-393
UT code for WoS article
—
EID of the result in the Scopus database
—