97 search results - page 1 / 20 » Making Nondeterminism Unambiguous |
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
HOTOS
2007
IEEE
13 years 8 months ago
2007
IEEE
Given that the majority of future processors will contain an abundance of execution cores, redundant execution can offer a promising method for increasing the availability and res...
EKAW
2000
Springer
13 years 8 months ago
2000
Springer
Guidelines for clinical practice are being introduced in an extensive way in more and more different fields of medicine They have the potential to improve the quality and cost-effi...
FMICS
2009
Springer
13 years 11 months ago
2009
Springer
Cell libraries often contain a simulation model in a system design language, such as Verilog. These languages usually involve nondeterminism, which in turn, poses a challenge to th...