The following pages link to (Q3762226):
Displaying 50 items.
- A multiple-valued logic approach to the design and verification of hardware circuits (Q266875) (← links)
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- Monotone real circuits are more powerful than monotone Boolean circuits (Q290209) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- On the nonnegative rank of distance matrices (Q436566) (← links)
- Cyclic Boolean circuits (Q442202) (← links)
- On the complexity of min-max sorting networks (Q454886) (← links)
- Length of polynomials over finite groups (Q494061) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- On the readability of monotone Boolean formulae (Q652622) (← links)
- On a small class of Boolean sums (Q671372) (← links)
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Fundamentals of quantum information theory (Q699526) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- Planar acyclic computation (Q751805) (← links)
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Limiting negations in non-deterministic circuits (Q837192) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Coverage metrics for temporal logic model checking (Q853721) (← links)
- Delay optimization of linear depth Boolean circuits with prescribed input arrival times (Q866541) (← links)
- Unsupervised learnable neuron model with nonlinear interaction on dendrites (Q889327) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Lower bounds to the complexity of symmetric Boolean functions (Q914382) (← links)
- Random Boolean formulas representing any Boolean function with asymptotically equal probability (Q915747) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- Comment on Kochol's paper ``Efficient monotone circuits for threshold functions'' (Q918706) (← links)
- Incremental branching programs (Q929291) (← links)
- Very large cliques are easy to detect (Q932700) (← links)
- Models and quantifier elimination for quantified Horn formulas (Q944709) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- The optimal read-once branching program complexity for the direct storage access function (Q963361) (← links)
- On convex complexity measures (Q964405) (← links)
- Investigation of the global dynamics of cellular automata using Boolean derivatives (Q971639) (← links)
- Playing monotone games to understand learning behaviors (Q974103) (← links)
- Smallest formulas for the parity of \(2^k\) variables are essentially unique (Q974758) (← links)
- Learning symmetric causal independence models (Q1009256) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- On the relation between fuzzy max-Archimedean t-norm relational equations and the covering problem (Q1040915) (← links)
