Skip to main content
Conference Proceedings

Non-intersecting complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3831 LNCS 158-165
DOI: 10.1007/11611257_13
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new complexity measure for Boolean functions is introduced in this article. It has a link to the query algorithms: it stands between both polynomial degree and non-deterministic complexity on one hand and still is a lower bound for deterministic complexity. Some inequalities and counterexamples are presented and usage in symmetrisation polynomials is considered. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Belovs, A. (2006). Non-intersecting complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3831 LNCS, pp. 158–165). https://doi.org/10.1007/11611257_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free