The following pages link to Ingo Wegener (Q171935):
Displayed 50 items.
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Worst case examples for operations on OBDDs (Q294746) (← links)
- Properties of complexity measures for PRAMs and WRAMs (Q580980) (← links)
- Real royal road functions for constant population size (Q596131) (← links)
- Precision, local search and unimodal functions (Q633830) (← links)
- On the effect of local changes in the variable ordering of ordered decision diagrams (Q671612) (← links)
- Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) (Q688722) (← links)
- On separating systems whose elements are sets of at most k elements (Q754202) (← links)
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- Minimum spanning trees made easier via multi-objective optimization (Q862963) (← links)
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem (Q884444) (← links)
- Efficient simulation of circuits by EREW PRAMs (Q911771) (← links)
- Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
- Optimal search with positive switch cost is NP-hard (Q1065706) (← links)
- On the complexity of slice functions (Q1066866) (← links)
- Time-space trade-offs for branching programs (Q1076517) (← links)
- More on the complexity of slice functions (Q1079365) (← links)
- The complexity of symmetric functions in bounded-depth circuits (Q1107989) (← links)
- Switching functions whose monotone complexity is nearly quadratic (Q1133519) (← links)
- A new lower bound on the monotone network complexity of Boolean sums (Q1137007) (← links)
- An improved complexity hierarchy on the depth of Boolean functions (Q1138531) (← links)
- Best possible asymptotic bounds on the depth of monotone functions in multivalued logic (Q1166488) (← links)
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n (Q1166489) (← links)
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits (Q1183575) (← links)
- The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) (Q1186810) (← links)
- A counterexample to a conjecture of Schnorr referring to monotone networks (Q1255472) (← links)
- Completeness and non-completeness results with respect to read-once projections (Q1271310) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- On the cut-off point for combinatorial group testing (Q1283788) (← links)
- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553) (← links)
- Reduction of OBDDs in linear time (Q1313758) (← links)
- Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\) (Q1322486) (← links)
- Solution of the knight's Hamiltonian path problem on chessboards (Q1326749) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- On the complexity of encoding in analog circuits (Q1350006) (← links)
- Bounds on the number of knight's tours (Q1356517) (← links)
- Efficient algorithms for the transformation between different types of binary decision diagrams (Q1357805) (← links)
- Complexity theory. Limits of the efficiency of algorithms (Q1395898) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
- (Q1587347) (redirect page) (← links)
- On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs (Q1587348) (← links)
- On the analysis of the \((1+1)\) evolutionary algorithm (Q1605304) (← links)
- The analysis of evolutionary algorithms on sorting and shortest paths problems (Q1774629) (← links)
- On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions (Q1775016) (← links)
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions (Q1802063) (← links)
- Minimal polynomials for the conjunction of functions on disjoint variables can be very simple (Q1823964) (← links)
- Relating monotone formula size and monotone depth of Boolean functions (Q1835900) (← links)
- The analysis of evolutionary algorithms -- A proof that crossover really can help (Q1849764) (← links)