Decomposition representations of logical equations in problems of inversion of discrete functions (Q404200): Difference between revisions

@@ Property / author @@
-Aleksandr Anatol'evich Semënov
@@ Property / author: Aleksandr Anatol'evich Semënov / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C29
@@ Property / Mathematics Subject Classification ID: 90C29 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6339521
@@ Property / zbMATH DE Number: 6339521 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+decomposition representations
@@ Property / zbMATH Keywords: decomposition representations / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+inversion of discrete functions
@@ Property / zbMATH Keywords: inversion of discrete functions / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Chaff
@@ Property / describes a project that uses: Chaff / rank @@
+Normal rank
@@ Property / author @@
+Aleksandr Anatol'evich Semënov
@@ Property / author: Aleksandr Anatol'evich Semënov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+BerkMin: A fast and robust SAT-solver
@@ Property / cites work: BerkMin: A fast and robust SAT-solver / rank @@
+Normal rank
@@ Property / cites work @@
+Q4388806
@@ Property / cites work: Q4388806 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+Classifying the computational complexity of problems
+Normal rank
@@ Property / cites work @@
+Resolution and binary decision diagrams cannot simulate each other polynomially
+Normal rank
@@ Property / cites work @@
+Q4692286
@@ Property / cites work: Q4692286 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1064230709050062
+Normal rank
@@ Property / OpenAlex ID @@
+W2007591820
@@ Property / OpenAlex ID: W2007591820 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:404200