Threshold functions and bounded deptii monotone circuits
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Circuits and local computation
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
Journal of the ACM (JACM)
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Analytic sets in descriptive set theory and NP sets in complexity theory
Fundamenta Informaticae
On Monotone Data Mining Languages
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
On Learning Monotone DNF under Product Distributions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Handbook of automated reasoning
On the minimum number of negations leading to super-polynomial savings
Information Processing Letters
The complexity of computations by networks
IBM Journal of Research and Development - Mathematics and computing
On learning monotone DNF under product distributions
Information and Computation
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Homomorphism preservation theorems
Journal of the ACM (JACM)
Homomorphism preservation on quasi-wide classes
Journal of Computer and System Sciences
Yuri, logic, and computer science
Fields of logic and computation
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Fundamenta Informaticae
When is naive evaluation possible?
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
In connection with the least fixed point operator the following question was raised: Suppose that a first-order formula P(P) is (semantically) monotone in a predicate symbol P on finite structures. Is P(P) necessarily equivalent on finite structures to a first-order formula with only positive occurrences of P? In this paper, this question is answered negatively. Moreover, the counterexample naturally gives a uniform sequence of constant-depth, polynomial-size, monotone Boolean circuits that is not equivalent to any (however nonuniform) sequence of constant-depth, polynomial-size, positive Boolean circuits.