Santa Fe Institute Collaboration Platform

Thermodynamics of Computation

Short pages

From Thermodynamics of Computation

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

View (previous 20 | next 20) (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) ‎Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes ‎[115 bytes]
  7. (hist) ‎On the hardness of approximating minimization problems ‎[115 bytes]
  8. (hist) ‎A complete problem for statistical zero knowledge ‎[115 bytes]
  9. (hist) ‎One way functions and pseudorandom generators ‎[115 bytes]
  10. (hist) ‎A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries ‎[115 bytes]
  11. (hist) ‎The complexity of facets (and some facets of complexity) ‎[115 bytes]
  12. (hist) ‎Fully parallelized multi prover protocols for NEXP-time ‎[115 bytes]
  13. (hist) ‎Polynomial-Time Approximation Algorithms for the Ising Model ‎[115 bytes]
  14. (hist) ‎Word problems requiring exponential time (Preliminary Report) ‎[115 bytes]
  15. (hist) ‎On the hardness of approximate reasoning ‎[115 bytes]
  16. (hist) ‎The intractability of resolution ‎[115 bytes]
  17. (hist) ‎Explicit Constructions of Concentrators ‎[115 bytes]
  18. (hist) ‎Improved decoding of reed-solomon and algebraic-geometry codes ‎[115 bytes]
  19. (hist) ‎Noise stability of functions with low influences: Invariance and optimality ‎[115 bytes]
  20. (hist) ‎Hard examples for resolution ‎[115 bytes]

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