S. Kosub. On NP-partitions over posets with an application to reducing the set of solutions of NP problems. In Proceedings 25th Symposium on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 467-476. Springer-verlag, Berlin, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Boolean Hierarchy of NP-Partitions - Kosub, Wagner (2000) (3 citations) Self-citation (Kosub) (Correct)
No context found.
S. Kosub. On NP-partitions over posets with an application to reducing the set of solutions of NP problems. In Proceedings 25th Symposium on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 467-476. Springer-verlag, Berlin, 2000.
Equivalence Problems for Boolean Constraint Satisfaction - Böhler, Hemaspaandra.. (2001) (Correct)
No context found.
S. Kosub. On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems April 2000.
Lecture Notes for Logic and Interaction - Böhler, Vollmer (2002) (Correct)
No context found.
S. Kosub. On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems April 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC