Pages that link to "Item:Q3191964"
From MaRDI portal
The following pages link to Proceedings of the thirty-second annual ACM symposium on Theory of computing (Q3191964):
Displayed 50 items.
- Extractors and pseudo-random generators with optimal seed length (Q3191965) (← links)
- Pseudo-random functions and factoring (extended abstract) (Q3191966) (← links)
- Satisfiability of equations in free groups is in PSPACE (Q3191967) (← links)
- Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) (Q3191968) (← links)
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) (Q3191969) (← links)
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume (Q3191970) (← links)
- Randomized metarounding (extended abstract) (Q3191971) (← links)
- Isomorphism testing for embeddable graphs through definability (Q3191972) (← links)
- Circuit minimization problem (Q3191973) (← links)
- On the efficiency of local decoding procedures for error-correcting codes (Q3191974) (← links)
- Statistical mechanics, three-dimensionality and NP-completeness (Q3191975) (← links)
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976) (← links)
- Improved algorithms for submodular function minimization and submodular flow (Q3191977) (← links)
- On dual minimum cost flow algorithms (extended abstract) (Q3191978) (← links)
- On the approximability of the traveling salesman problem (extended abstract) (Q3191979) (← links)
- Approximating the domatic number (Q3191980) (← links)
- The value of strong inapproximability results for clique (Q3191981) (← links)
- The small-world phenomenon (Q3191982) (← links)
- A random graph model for massive graphs (Q3191983) (← links)
- List decoding algorithms for certain concatenated codes (Q3191984) (← links)
- A PCP characterization of NP with optimal amortized query complexity (Q3191985) (← links)
- On transformation of interactive proofs that preserve the prover's complexity (Q3191986) (← links)
- On the sum-of-squares algorithm for bin packing (Q3191987) (← links)
- Sharing the cost of muliticast transmissions (preliminary version) (Q3191988) (← links)
- The risk profile problem for stock portfolio optimization (extended abstract) (Q3191989) (← links)
- Resettable zero-knowledge (extended abstract) (Q3191990) (← links)
- Complete characterization of security notions for probabilistic private-key encryption (Q3191991) (← links)
- On zero-knowledge proofs (extended abstract) (Q3191992) (← links)
- Smoothing and cleaning up slivers (Q3191993) (← links)
- Hard-Potato routing (Q3191994) (← links)
- Approximation algorithms for geometric shortest path problems (Q3191995) (← links)
- Improved approximations of crossings in graph drawings (Q3191996) (← links)
- On the decidability of accessibility problems (extended abstract) (Q3191998) (← links)
- More general completeness theorems for secure two-party computation (Q3191999) (← links)
- On the complexity of verifiable secret sharing and multiparty computation (Q3192000) (← links)
- Tight(er) worst-case bounds on dynamic searching and priority queues (Q3192001) (← links)
- Near-optimal fully-dynamic graph connectivity (Q3192002) (← links)
- A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (Q3192003) (← links)
- Space complexity in propositional calculus (Q3192004) (← links)
- Higher lower bounds on monotone size (Q3192005) (← links)
- Tighter bounds for nearest neighbor search and related problems in the cell probe model (Q3192006) (← links)
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (Q3192007) (← links)
- Faster suffix tree construction with missing suffix links (Q3192008) (← links)
- Approximate nearest neighbors and sequence comparison with block operations (Q3192009) (← links)
- More theory revision with queries (extended abstract) (Q3192012) (← links)
- Are bitvectors optimal? (Q3192013) (← links)
- The program-size complexity of self-assembled squares (extended abstract) (Q3192015) (← links)
- Shortest path queries in planar graphs (Q3192016) (← links)
- How tall is a tree? (Q3192017) (← links)
- Random walks with “back buttons” (extended abstract) (Q3192018) (← links)