A hard problem that is almost always easy

Havas G. and Majewski B.S. (1995). A hard problem that is almost always easy. In: Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. 6th International Symposium on Algorithms and Computations, ISAAC 1995, , (216-223). December 4, 1995-December 6, 1995.

Author Havas G.
Majewski B.S.
Title of paper A hard problem that is almost always easy
Conference name 6th International Symposium on Algorithms and Computations, ISAAC 1995
Conference dates December 4, 1995-December 6, 1995
Proceedings title Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings
Journal name Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Series Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher Springer Verlag
Publication Year 1995
Sub-type Fully published paper
Open Access Status Not yet assessed
ISBN 3540605738
ISSN 1611-3349
Volume 1004
Start page 216
End page 223
Total pages 8
Subjects 1700 Computer Science
2614 Theoretical Computer Science
Q-Index Code E1
Institutional Status Unknown

Document type: Conference Paper
Collection: Scopus Import - Archived
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 5 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 06 Sep 2016, 10:45:48 EST by System User