Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
type: Item
instance of: scholarly article
title: Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
zbMATH Open document ID: 0939.68043
DOI: 10.1016/S0304-3975(98)00170-4
author: H. Venkateswaran
author: Rimli Sengupta
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1454562
zbMATH Keywords: Boolean circuit
zbMATH Keywords: monotonicity
zbMATH Keywords: cancellation
zbMATH Keywords: determinant
zbMATH Keywords: complexity classes
MaRDI profile type: Publication
cites work: Monotone versus positive
cites work: The monotone circuit complexity of Boolean functions
cites work: A very hard log-space counting class
cites work: Superpolynomial lower bounds for monotone span programs
cites work: Two Applications of Inductive Counting for Complementation Problems
cites work: Structure and importance of logspace-MOD class
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Nondeterministic Space is Closed under Complementation
cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth
cites work: Q5557960
cites work: Q3758729
cites work: Lower bounds on monotone complexity of the logical permanent
cites work: Separation of the monotone NC hierarchy
cites work: Monotone circuits for matching require linear depth
cites work: Q4035672
cites work: Q3793690
cites work: Gaussian elimination is not optimal
cites work: Q3815544
cites work: The gap between monotone and non-monotone circuit complexity is exponential
cites work: On the complexity of negation-limited Boolean networks (preliminary version)
cites work: The complexity of computing the permanent
cites work: Negation can be exponentially powerful
cites work: Circuit Definitions of Nondeterministic Complexity Classes
description: scientific article; zbMATH DE number 1454562