Searching for "System BV is NP-complete." – sorted by Relevance.
-
System BV is NP-complete
- Abstract System BV is NP-complete Ozan Kahramano˘gulları 1,2 Computer Science Institute
- Cited by 7 (0 self) – Add To MetaCart
-
Reducing Nondeterminism in the Calculus of Structures
- these techniques as a combinatorial proof theoretical tool for proving that system BV is NP-complete [13]. The rest
- Cited by 11 (0 self) – Add To MetaCart
-
Implementing Deep Inference in TOM
- . Kahramano˘gulları showed, in [11], that system BV is NP-complete. The calculus of structures also provides
- Cited by 1 (0 self) – Add To MetaCart
-
Implementing deep inference in TOM
- . Kahramano˘gulları showed, in [11], that system BV is NP-complete. The calculus of structures also provides
- Add To MetaCart

