Generic complexity of Presburger arithmetic (Q848747): 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.1007/s00224-008-9120-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1996544046
@@ Property / OpenAlex ID: W1996544046 / rank @@
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+On Worst‐Case to Average‐Case Reductions for NP Problems
+Normal rank
@@ Property / cites work @@
+Q3413362
@@ Property / cites work: Q3413362 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4082296
@@ Property / cites work: Q4082296 / rank @@
+Normal rank
@@ Property / cites work @@
+The halting problem is decidable on a set of asymptotic probability one
+Normal rank
@@ Property / cites work @@
+Generic-case complexity, decision problems in group theory, and random walks.
+Normal rank
@@ Property / cites work @@
+Average-case complexity and decision problems in group theory.
+Normal rank
@@ Property / cites work @@
+Linear probing and graphs
@@ Property / cites work: Linear probing and graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:848747