2661 search results - page 339 / 533 » Quantum Complexity Classes |
183
click to vote
VLSID
1997
IEEE
15 years 10 months ago
1997
IEEE
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
183
click to vote
CIKM
1997
Springer
15 years 10 months ago
1997
Springer
: In the context of knowledge management, we focus on the representation and the retrieval of past experiences called cases within the Case-Based Reasoning (CBR) paradigm. CBR is a...
145
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
158
click to vote
ICPP
1994
IEEE
15 years 10 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
150
click to vote
ICALP
1994
Springer
15 years 10 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...