On the Complexity of Negation-Limited Boolean Networks

Journal article

Open access

Peer reviewed

On the Complexity of Negation-Limited Boolean Networks

Robert Beals, Tetsuro Nishino and Keisuke Tanaka

SIAM journal on computing, Vol.27(5), pp.1334-1347

10/1998

DOI: https://doi.org/10.1137/S0097539794275136

Files and links (1)

url

https://doi.org/10.1137/S0097539794275136View

Version of Record (VoR) Open

Metrics

8 Record Views

22 Times Cited - Web of Science

Details

Title: On the Complexity of Negation-Limited Boolean Networks
Creators: Robert Beals
Tetsuro Nishino
Keisuke Tanaka
Publication Details: SIAM journal on computing, Vol.27(5), pp.1334-1347
Date published: 10/1998
Academic Unit: Mathematics (SAS)
Language: English
Resource Type: Journal article
Identifiers: 991031664288804646