Information and Systems-Theoretical Foundations of Computing(Date:1994/04/27)

Presentation
表紙

,  

[Date]1994/4/27
[Paper #]
目次

,  

[Date]1994/4/27
[Paper #]
The Maximal f-Dependent Set Problem for Planar Graphs Is in NC

Zhi-zhong Chen,  

[Date]1994/4/27
[Paper #]COMP94-1
Manpower Shift scheduling with Monotonic Constraints

Hoong chuin Lau,  

[Date]1994/4/27
[Paper #]COMP94-2
A extension of unfold/fold transformation for Prolog programs

Takashi Shiode,  Masaki Murakami,  

[Date]1994/4/27
[Paper #]COMP94-3
Test Instance Generation for Promised NP Search Problems

Osamu Watanabe,  

[Date]1994/4/27
[Paper #]COMP94-4
On a Method to Solve NP-Complete Problems in Polynomial Time Using the Universal Quantum Turing Machine

Takashi Mihara,  Tetsuro Nishino,  

[Date]1994/4/27
[Paper #]COMP94-5
On the Complexity of Negation-Limited Inverters

Keisuke Tanaka,  Tetsuro Nishino,  

[Date]1994/4/27
[Paper #]COMP94-6
[OTHERS]

,  

[Date]1994/4/27
[Paper #]