Non-cancellative Boolean circuits: A generalization of monotone boolean circuits

Cancellations are known to be helpful in efficient algebraic computation of polynomials over fields. We define a notion of cancellation in Boolean circuits and define Boolean circuits that do not use cancellation to be non-cancellative. Non-cancellative Boolean circuits are a natural generalization...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 237; číslo 1; s. 197 - 212
Hlavní autoři:	Sengupta, Rimli, Venkateswaran, H.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 28.04.2000 Elsevier
Témata:	Algebraic logic Boolean circuit Cancellation Combinatorics Combinatorics. Ordered structures Complexity classes Determinant Exact sciences and technology Graph theory Logic and foundations Mathematical logic, foundations, set theory Mathematics Monotonicity Sciences and techniques of general use Cancellation Boolean circuit Determinant Monotonicity Complexity classes Boolean logic Completeness Boolean function Graph theory Boolean algebra Complexity
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!