Transformations into Normal Forms for Quantified Circuits (Q3007687): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-21581-0_20
+Normal rank
@@ Property / OpenAlex ID @@
+W2121507897
@@ Property / OpenAlex ID: W2121507897 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence of Horn and network complexity for Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4364508
@@ Property / cites work: Q4364508 / rank @@
+Normal rank
@@ Property / cites work @@
+Models and quantifier elimination for quantified Horn formulas
+Normal rank
@@ Property / cites work @@
+Q2786912
@@ Property / cites work: Q2786912 / rank @@
+Normal rank
@@ Property / cites work @@
+Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
+Normal rank
@@ Property / cites work @@
+Q4489064
@@ Property / cites work: Q4489064 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting Circuit Representations in QBF Solving
@@ Property / cites work: Exploiting Circuit Representations in QBF Solving / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754079
@@ Property / cites work: Q2754079 / rank @@
+Normal rank