Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

1. (hist) ‎Test page ‎[30 bytes]
2. (hist) ‎Losses In Ventilation ‎[59 bytes]
3. (hist) ‎Neural Information Theory ‎[60 bytes]
4. (hist) ‎Manfred Laubichler ‎[78 bytes]
5. (hist) ‎Jan Korbel ‎[106 bytes]
6. (hist) ‎Efficient checking of computations ‎[115 bytes]
7. (hist) ‎On Computable Numbers, With Application to the Entscheidungs Problem ‎[115 bytes]
8. (hist) ‎Pseudorandomness and average-case complexity via uniform reductions ‎[115 bytes]
9. (hist) ‎Approximate counting, uniform generation and rapidly mixing Markov chains ‎[115 bytes]
10. (hist) ‎Hardness vs randomness ‎[115 bytes]
11. (hist) ‎How to recycle random bits ‎[115 bytes]
12. (hist) ‎Probabilistic algorithm for testing primality ‎[115 bytes]
13. (hist) ‎Average Case Complete Problems ‎[115 bytes]
14. (hist) ‎A Parallel Repetition Theorem ‎[115 bytes]
15. (hist) ‎Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis ‎[115 bytes]
16. (hist) ‎On Extracting Randomness from Weak Random Sources ‎[115 bytes]
17. (hist) ‎Las Vegas is better than determinism in VLSI and distributed computing ‎[115 bytes]
18. (hist) ‎On the degree of boolean functions as real polynomials ‎[115 bytes]
19. (hist) ‎Optimization, approximation, and complexity classes ‎[115 bytes]
20. (hist) ‎The history and status of the P versus NP question ‎[115 bytes]
21. (hist) ‎Every Prime Has a Succinct Certificate ‎[115 bytes]
22. (hist) ‎CREW PRAMs and Decision Trees ‎[115 bytes]
23. (hist) ‎Learning decision trees using the Fourier spectrum ‎[115 bytes]
24. (hist) ‎Vertex cover might be hard to approximate to within 2 - ε ‎[115 bytes]
25. (hist) ‎On rank vs. communication complexity ‎[115 bytes]
26. (hist) ‎Lower bounds for resolution and cutting plane proofs and monotone computations ‎[115 bytes]
27. (hist) ‎Easiness Assumptions and Hardness Tests: Trading Time for Zero Error ‎[115 bytes]
28. (hist) ‎Resolution lower bounds for the weak functional pigeonhole principle ‎[115 bytes]
29. (hist) ‎Precis of The Emperor's New Mind ‎[115 bytes]
30. (hist) ‎On the Complexity of a Concentrator ‎[115 bytes]
31. (hist) ‎Hard examples for resolution ‎[115 bytes]
32. (hist) ‎Noise stability of functions with low influences: Invariance and optimality ‎[115 bytes]
33. (hist) ‎Improved decoding of reed-solomon and algebraic-geometry codes ‎[115 bytes]
34. (hist) ‎Explicit Constructions of Concentrators ‎[115 bytes]
35. (hist) ‎The intractability of resolution ‎[115 bytes]
36. (hist) ‎Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes ‎[115 bytes]
37. (hist) ‎On the hardness of approximate reasoning ‎[115 bytes]
38. (hist) ‎Word problems requiring exponential time (Preliminary Report) ‎[115 bytes]
39. (hist) ‎Polynomial-Time Approximation Algorithms for the Ising Model ‎[115 bytes]
40. (hist) ‎Fully parallelized multi prover protocols for NEXP-time ‎[115 bytes]
41. (hist) ‎The complexity of facets (and some facets of complexity) ‎[115 bytes]
42. (hist) ‎A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries ‎[115 bytes]
43. (hist) ‎One way functions and pseudorandom generators ‎[115 bytes]
44. (hist) ‎A complete problem for statistical zero knowledge ‎[115 bytes]
45. (hist) ‎On the hardness of approximating minimization problems ‎[115 bytes]
46. (hist) ‎Lower bounds for polynomial calculus: Non-binomial case ‎[115 bytes]
47. (hist) ‎Expanders, randomness, or time versus space: Extended abstract ‎[115 bytes]
48. (hist) ‎Combinatorial Problems and Exercises ‎[115 bytes]
49. (hist) ‎The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l 1 ‎[115 bytes]
50. (hist) ‎Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? ‎[115 bytes]

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)