Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the complexity of generating synchronizable test sequences

From MaRDI portal
Publication:1203646
Jump to:navigation, search

DOI10.1016/0885-064X(92)90006-WzbMath0758.68035MaRDI QIDQ1203646

Ching-Sung Lu, Gen-Huey Chen, Lung-Tien Liu

Publication date: 22 February 1993

Published in: Journal of Complexity (Search for Journal in Brave)


zbMATH Keywords

approximation algorithmconformance testingprotocol engineering\(NP\)- hardminimum-cost synchronizable test sequencetest sequence generation


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)




Cites Work

  • Approximate Traveling Salesman Algorithms
  • P-Complete Approximation Problems
  • On general routing problems
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1203646&oldid=13267001"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 07:08.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki