Complexity results for classes of quantificational formulas (Q1157324): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(80)90027-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2080220005
@@ Property / OpenAlex ID: W2080220005 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear sampling and the ∀∃∀ case of the decision problem
+Normal rank
@@ Property / cites work @@
+Solvable cases of the decision problem
@@ Property / cites work: Solvable cases of the decision problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138187
@@ Property / cites work: Q4138187 / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy for nondeterministic time complexity
@@ Property / cites work: A hierarchy for nondeterministic time complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Classification of $AEA$ formulas by letter atoms
@@ Property / cites work: Classification of $AEA$ formulas by letter atoms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3905252
@@ Property / cites work: Q3905252 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Algorithms
@@ Property / cites work: On the Computational Complexity of Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Turing machines and the spectra of first-order formulas
+Normal rank
@@ Property / cites work @@
+Description of restricted automata by first-order formulae
+Normal rank
@@ Property / cites work @@
+Q3856727
@@ Property / cites work: Q3856727 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability problems for propositional calculi
@@ Property / cites work: Satisfiability problems for propositional calculi / rank @@
+Normal rank
@@ Property / cites work @@
+Q3915990
@@ Property / cites work: Q3915990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4090322
@@ Property / cites work: Q4090322 / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
+Normal rank
@@ Property / cites work @@
+Complete problems in the first-order predicate calculus
+Normal rank
@@ Property / cites work @@
+Q3888985
@@ Property / cites work: Q3888985 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573940
@@ Property / cites work: Q5573940 / rank @@
+Normal rank