On memoryless provers and insincere verifiers (Q3639202): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/09528130903119328
+Normal rank
@@ Property / OpenAlex ID @@
+W1965051705
@@ Property / OpenAlex ID: W1965051705 / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to set constraint-based program analysis
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
+Normal rank
@@ Property / cites work @@
+A new approach to dynamic all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
+Normal rank
@@ Property / cites work @@
+A randomized linear-time algorithm to find minimum spanning trees
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Simultaneous Diophantine Approximation Problems
+Normal rank
@@ Property / cites work @@
+Symmetric space-bounded computation
@@ Property / cites work: Symmetric space-bounded computation / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of totally clairvoyant scheduling
@@ Property / cites work: An analysis of totally clairvoyant scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+CASCADING RANDOM WALKS
@@ Property / cites work: CASCADING RANDOM WALKS / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank