DocumentCode :
2237477
Title :
On the complexity of the monotonicity verification
Author :
Voronenko, Andrei A.
Author_Institution :
Dept. of Comput. Math. & Cybern., Moscow State Univ., Russia
fYear :
2000
fDate :
2000
Firstpage :
235
Lastpage :
238
Abstract :
We present a sequence {Sn} of circuits of functional elements that check the monotonicity of input discrete functions depending on n variables and represented as value column vectors. The complexity of circuits equals O(N√log log N). This is the lowest asymptotical current complexity
Keywords :
computational complexity; polynomials; asymptotical current complexity; complexity; functional elements; input discrete functions; monotonicity verification; value column vectors; Boolean functions; Cloning; Control systems; Decoding; Logic circuits; Organizations; Polynomials; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Complexity, 2000. Proceedings. 15th Annual IEEE Conference on
Conference_Location :
Florence
ISSN :
1093-0159
Print_ISBN :
0-7695-0674-7
Type :
conf
DOI :
10.1109/CCC.2000.856754
Filename :
856754
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2237477
بازگشت