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)
- (hist) Test page [30 bytes]
- (hist) Losses In Ventilation [59 bytes]
- (hist) Neural Information Theory [60 bytes]
- (hist) Manfred Laubichler [78 bytes]
- (hist) Jan Korbel [106 bytes]
- (hist) Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes [115 bytes]
- (hist) On the hardness of approximating minimization problems [115 bytes]
- (hist) A complete problem for statistical zero knowledge [115 bytes]
- (hist) One way functions and pseudorandom generators [115 bytes]
- (hist) A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries [115 bytes]
- (hist) The complexity of facets (and some facets of complexity) [115 bytes]
- (hist) Fully parallelized multi prover protocols for NEXP-time [115 bytes]
- (hist) Polynomial-Time Approximation Algorithms for the Ising Model [115 bytes]
- (hist) Word problems requiring exponential time (Preliminary Report) [115 bytes]
- (hist) On the hardness of approximate reasoning [115 bytes]
- (hist) The intractability of resolution [115 bytes]
- (hist) Explicit Constructions of Concentrators [115 bytes]
- (hist) Improved decoding of reed-solomon and algebraic-geometry codes [115 bytes]
- (hist) Noise stability of functions with low influences: Invariance and optimality [115 bytes]
- (hist) Hard examples for resolution [115 bytes]