The computational complexity of the circuit value and network stability problems
By: by Ashok Subramanian.
Series: Report ;; no. STAN-CS-90-1311; Report (Stanford University. Computer Science Dept.) ;; no. STAN-CS-90-1311.
Publisher: Dept. of Computer Science, Stanford University
Published: 1990
Place of publication: Stanford, Calif
Language: eng
Number of pages: 163
Subjects: Electric network analysis.; Computational complexity.; Marriage theorem.
Other titles: Circuit value and network stability problems.
Notes: Includes bibliographical references (p. 160-163).
Thesis (Ph. D.)--Stanford University, 1990.
Cover title.
"May 1990."