The following pages link to (Q1144941):
Displaying 47 items.
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943) (← links)
- (Q1162527) (redirect page) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- Time bounds for selection (Q1394121) (← links)
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain (Q1822415) (← links)
- On the problem of sorting burnt pancakes (Q1897357) (← links)
- A stagewise parameter estimation procedure for correlated data (Q2394867) (← links)
- Naturally Rehearsing Passwords (Q2867165) (← links)
- (Q3128932) (← links)
- (Q3197310) (← links)
- (Q3212297) (← links)
- (Q3332246) (← links)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits (Q3339289) (← links)
- A Simple Unpredictable Pseudo-Random Number Generator (Q3738458) (← links)
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information (Q3739050) (← links)
- (Q3826476) (← links)
- Coin flipping by telephone a protocol for solving impossible problems (Q3967048) (← links)
- Inductive inference and unsolvability (Q3985087) (← links)
- Noninteractive Zero-Knowledge (Q3985810) (← links)
- On Almost Everywhere Complex Recursive Functions (Q4076767) (← links)
- On complexity properties of recursively enumerable sets (Q4101804) (← links)
- (Q4125778) (← links)
- Toward a mathematical theory of inductive inference (Q4154852) (← links)
- Software reliability via run-time result-checking (Q4208876) (← links)
- (Q4230365) (← links)
- Designing programs that check their work (Q4369864) (← links)
- Reflections on the Pentium division bug (Q4406359) (← links)
- (Q4434882) (← links)
- (Q4474165) (← links)
- Program result checking: A new approach to making programs more reliable (Q4630244) (← links)
- (Q4638058) (← links)
- Self-correcting for function fields of finite transcendental degree (Q4645210) (← links)
- Reversing trains: A turn of the century sorting problem (Q4729371) (← links)
- (Q4777269) (← links)
- Reducibility Among Protocols (Q5019325) (← links)
- Checking approximate computations over the reals (Q5248550) (← links)
- On effective procedures for speeding up algorithms (Q5402504) (← links)
- Machine Dependence of Degrees of Difficulty (Q5508280) (← links)
- A Machine-Independent Theory of the Complexity of Recursive Functions (Q5537605) (← links)
- A Remarkable Class of Mannheim-Curves (Q5541315) (← links)
- On the size of machines (Q5549809) (← links)
- On the Sums of Independently Distributed Pareto Variates (Q5620228) (← links)
- On Effective Procedures for Speeding Up Algorithms (Q5625127) (← links)
- (Q5628113) (← links)
- (Q5628114) (← links)
- (Q5724326) (← links)
