Short pages
From Thermodynamics of Computation
Showing below up to 100 results in range #1 to #100.
View (previous 100 | next 100) (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) On the Complexity of a Concentrator [115 bytes]
- (hist) Hard examples for resolution [115 bytes]
- (hist) Noise stability of functions with low influences: Invariance and optimality [115 bytes]
- (hist) Improved decoding of reed-solomon and algebraic-geometry codes [115 bytes]
- (hist) Explicit Constructions of Concentrators [115 bytes]
- (hist) The intractability of resolution [115 bytes]
- (hist) Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes [115 bytes]
- (hist) On the hardness of approximate reasoning [115 bytes]
- (hist) Word problems requiring exponential time (Preliminary Report) [115 bytes]
- (hist) Polynomial-Time Approximation Algorithms for the Ising Model [115 bytes]
- (hist) Fully parallelized multi prover protocols for NEXP-time [115 bytes]
- (hist) The complexity of facets (and some facets of complexity) [115 bytes]
- (hist) A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries [115 bytes]
- (hist) One way functions and pseudorandom generators [115 bytes]
- (hist) A complete problem for statistical zero knowledge [115 bytes]
- (hist) On the hardness of approximating minimization problems [115 bytes]
- (hist) Lower bounds for polynomial calculus: Non-binomial case [115 bytes]
- (hist) Expanders, randomness, or time versus space: Extended abstract [115 bytes]
- (hist) Combinatorial Problems and Exercises [115 bytes]
- (hist) The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l 1 [115 bytes]
- (hist) Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? [115 bytes]
- (hist) On Computable Numbers, With Application to the Entscheidungs Problem [115 bytes]
- (hist) Precis of The Emperor's New Mind [115 bytes]
- (hist) Communication lower bounds using directional derivatives [115 bytes]
- (hist) Efficient checking of computations [115 bytes]
- (hist) Pseudorandomness and average-case complexity via uniform reductions [115 bytes]
- (hist) Approximate counting, uniform generation and rapidly mixing Markov chains [115 bytes]
- (hist) Hardness vs randomness [115 bytes]
- (hist) How to recycle random bits [115 bytes]
- (hist) Probabilistic algorithm for testing primality [115 bytes]
- (hist) Average Case Complete Problems [115 bytes]
- (hist) A Parallel Repetition Theorem [115 bytes]
- (hist) Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis [115 bytes]
- (hist) On Extracting Randomness from Weak Random Sources [115 bytes]
- (hist) Las Vegas is better than determinism in VLSI and distributed computing [115 bytes]
- (hist) On the degree of boolean functions as real polynomials [115 bytes]
- (hist) Optimization, approximation, and complexity classes [115 bytes]
- (hist) The history and status of the P versus NP question [115 bytes]
- (hist) Every Prime Has a Succinct Certificate [115 bytes]
- (hist) CREW PRAMs and Decision Trees [115 bytes]
- (hist) Learning decision trees using the Fourier spectrum [115 bytes]
- (hist) Vertex cover might be hard to approximate to within 2 - ε [115 bytes]
- (hist) On rank vs. communication complexity [115 bytes]
- (hist) Lower bounds for resolution and cutting plane proofs and monotone computations [115 bytes]
- (hist) Easiness Assumptions and Hardness Tests: Trading Time for Zero Error [115 bytes]
- (hist) Resolution lower bounds for the weak functional pigeonhole principle [115 bytes]
- (hist) BPP and the polynomial hierarchy [115 bytes]
- (hist) Disjointness is hard in the multiparty number-on-the-forehead model [115 bytes]
- (hist) On the complexity of matrix product [115 bytes]
- (hist) A theory of the learnable [115 bytes]
- (hist) Correcting errors beyond the Guruswami-Sudan radius in polynomial time [115 bytes]
- (hist) Pseudorandom generators for space-bounded computation [115 bytes]
- (hist) Natural Proofs [115 bytes]
- (hist) Sampling adsorbing staircase walks using a new Markov chain decomposition method [115 bytes]
- (hist) Unbalanced expanders and randomness extractors from parvaresh-vardy codes [115 bytes]
- (hist) Large Deviation Bounds for Markov Chains [115 bytes]
- (hist) Universal sequential search problems [115 bytes]
- (hist) Digitalized Signatures and Public-Key Functions as Intractable as Factorization [115 bytes]
- (hist) Derandomizing polynomial identity tests means proving circuit lower bounds [115 bytes]
- (hist) Factoring numbers in O(logn) arithmetic steps [115 bytes]
- (hist) Application of Boolean Algebra to Switching Circuit Design and to Error Detection [115 bytes]
- (hist) Matching is as easy as matrix inversion [115 bytes]
- (hist) Randomness-efficient sampling within NC1 [115 bytes]
- (hist) Pseudo-random generators for all hardnesses [115 bytes]
- (hist) On the Structure of Polynomial Time Reducibility [115 bytes]
- (hist) An O(log n log log n) Space Algorithm for Undirected st-connectivity [115 bytes]
- (hist) Games against nature [115 bytes]
- (hist) Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution [115 bytes]
- (hist) Extractors and pseudorandom generators [115 bytes]
- (hist) Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack [115 bytes]
- (hist) Are Recursion Theoretic Arguments Useful in Complexity Theory? [115 bytes]
- (hist) Founding Cryptography on Oblivious Transfer [115 bytes]
- (hist) Tight estimates for eigenvalues of regular graphs [115 bytes]
- (hist) The influence of variables on Boolean functions [115 bytes]
- (hist) Hierarchies of memory limited computations [115 bytes]
- (hist) Towards the parallel repetition conjecture [115 bytes]
- (hist) Monotone Circuits for Connectivity Require Super-Logarithmic Depth [115 bytes]
- (hist) Algebraic methods in the theory of lower bounds for Boolean circuit complexity [115 bytes]
- (hist) Some optimal inapproximability results [115 bytes]
- (hist) Cryptographic Limitations on Learning Boolean Formulae and Finite Automata [115 bytes]
- (hist) On the generation of cryptographically strong pseudo-random sequences [115 bytes]
- (hist) A complexity theoretic approach to randomness [115 bytes]
- (hist) Ramanujan graphs [115 bytes]
- (hist) Undirected ST-connectivity in log-space [115 bytes]
- (hist) Dropbox Quick Start [115 bytes]
- (hist) Reliable Quantum Computers (1997) [115 bytes]
- (hist) The unified theory of pseudorandomness: guest column [115 bytes]
- (hist) Randomized algorithms [115 bytes]
- (hist) Private coins versus public coins in interactive proof systems [115 bytes]
- (hist) Inapproximability of Combinatorial Optimization Problems [115 bytes]
- (hist) Lower bounds on the size of bounded depth circuits over a complete basis with logical addition [115 bytes]
- (hist) Lower bounds on probabilistic linear decision trees [115 bytes]
- (hist) Fault Tolerant Quantum Computation [115 bytes]
- (hist) A Kilobit Special Number Field Sieve Factorization [115 bytes]
- (hist) Lattice Based Cryptography [115 bytes]