Computational properties of metaquerying problems
ACM Transactions on Computational Logic (TOCL)
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
On the complexity of inducing categorical and quantitative association rules
Theoretical Computer Science
| Hi-index | 0.00 |