Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 1709292 results
Sort by: relevance publication year

The complexity of symmetric boolean functions

BOOK CHAPTER published 1987 in Computation Theory and Logic

Authors: Ingo Wegener

Boolean functions whose monotone complexity is of size n2/log n

BOOK CHAPTER published in Lecture Notes in Computer Science

Authors: Ingo Wegener

The conjunctive complexity of quadratic Boolean functions

JOURNAL ARTICLE published April 1991 in Theoretical Computer Science

Authors: Katja Lenz | Ingo Wegener

Boolean functions whose monotone complexity is of size n2log n

JOURNAL ARTICLE published November 1982 in Theoretical Computer Science

Authors: Ingo Wegener

The critical complexity of all (monotone) boolean functions and monotone graph properties

BOOK CHAPTER published in Fundamentals of Computation Theory

Authors: Ingo Wegener

An improved complexity hierarchy on the depth of Boolean functions

JOURNAL ARTICLE published 1981 in Acta Informatica

Authors: Ingo Wegener

Symmetry Functions in AC° can be Computed in Constant Depth with Very Small Size

BOOK CHAPTER published 5 November 1992 in Boolean Function Complexity

Authors: Ingo Wegener | Norbert Wurm | Sang-Zin Yi

Proving lower bounds on the monotone complexity of Boolean functions

BOOK CHAPTER published 1984 in Logic and Machines: Decision Problems and Complexity

Authors: Ingo Wegener

The conjunctive complexity of quadratic boolean functions

BOOK CHAPTER published 1988 in Lecture Notes in Computer Science

Authors: Katja Lenz | Ingo Wegener

On the non-approximability of Boolean functions by OBDDs and read-k-times branching programs

PROCEEDINGS ARTICLE published in Proceedings 16th Annual IEEE Conference on Computational Complexity

Authors: B. Bollig | M. Sauerhoff | I. Wegener

The Complexity of Boolean Functions

BOOK CHAPTER published in Complexity Theory

The multiplicative complexity of quadratic Boolean functions

PROCEEDINGS ARTICLE published October 1987 in 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)

Authors: R. Mirwald | C. P. Schnorr

The monotone circuit complexity of boolean functions

JOURNAL ARTICLE published March 1987 in Combinatorica

Authors: Noga Alon | Ravi B. Boppana

On Read-Once Boolean Functions

BOOK CHAPTER published 5 November 1992 in Boolean Function Complexity

Authors: Ilan Newman

Coordination Complexity and the Rank of Boolean Functions

BOOK CHAPTER published 1987 in Open Problems in Communication and Computation

Authors: B. Gopinath | V. K. Wei

The complexity of symmetric functions in bounded-depth circuits

JOURNAL ARTICLE published June 1987 in Information Processing Letters

Authors: Bettina Brustmann | Ingo Wegener

Networks Computing Boolean Functions for Multiple Input Values

BOOK CHAPTER published 5 November 1992 in Boolean Function Complexity

Authors: Dietmar Uhlig

Circuit Complexity

BOOK CHAPTER published 28 June 2010 in Boolean Models and Methods in Mathematics, Computer Science, and Engineering

Authors: Matthias Krause | Ingo Wegener

A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs

JOURNAL ARTICLE published June 1998 in Evolutionary Computation

Authors: Stefan Droste | Thomas Jansen | Ingo Wegener

Algorithmic complexity

OTHER published 16 May 2011 in Boolean Functions