The following pages link to Larry J. Stockmeyer (Q1134519):
Displaying 50 items.
- (Q1063573) (redirect page) (← links)
- Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574) (← links)
- Uniform data encodings (Q1134520) (← links)
- NP-completeness of some generalizations of the maximum matching problem (Q1168728) (← links)
- (Q1230636) (redirect page) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- A characterization of the power of vector machines (Q1232182) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- Storage schemes for boundedly extendible arrays (Q1237541) (← links)
- Evaluation of polynomials with super-preconditioning (Q1243131) (← links)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (Q1331949) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Fast on-line integer multiplication (Q1847139) (← links)
- On monadic NP vs monadic co-NP (Q1898480) (← links)
- Efficiently extendible mappings for balanced data distribution (Q1920430) (← links)
- (Q3204032) (← links)
- Simulation of Parallel Random Access Machines by Circuits (Q3316595) (← links)
- Constant Depth Reducibility (Q3325043) (← links)
- Alternating Pushdown and Stack Automata (Q3325044) (← links)
- Optimal orientations of cells in slicing floorplan designs (Q3334981) (← links)
- (Q3341893) (← links)
- Magic Functions (Q3452511) (← links)
- Compactly encoding unstructured inputs with differential compression (Q3455534) (← links)
- Cosmological lower bound on the circuit complexity of a small problem in logic (Q3455548) (← links)
- Flipping Persuasively in Constant Time (Q3476272) (← links)
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata (Q3495661) (← links)
- An Architecture for Provably Secure Computation (Q3525747) (← links)
- 2-round zero knowledge and proof auditors (Q3579205) (← links)
- Pseudorandom number generation and space complexity (Q3694692) (← links)
- On Approximation Algorithms for # P (Q3718150) (← links)
- Alternation bounded auxiliary pushdown automata (Q3718176) (← links)
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (Q3766845) (← links)
- On the minimal synchronism needed for distributed consensus (Q3768381) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- (Q3786016) (← links)
- Parallel Algorithms for Term Matching (Q3796803) (← links)
- Provably Difficult Combinatorial Games (Q3854623) (← links)
- (Q3888985) (← links)
- (Q3922172) (← links)
- Alternation (Q3928246) (← links)
- Hashing Schemes for Extendible Arrays (Q4127987) (← links)
- (Q4131648) (← links)
- (Q4133106) (← links)
- On the combinational complexity of certain symmetric Boolean functions (Q4146674) (← links)
- (Q4158480) (← links)
- (Q4162478) (← links)
- (Q4230357) (← links)
- Bounds on the time to reach agreement in the presence of timing uncertainty (Q4299298) (← links)
- Finite state verifiers I (Q4302790) (← links)
