Search by property
From Thermodynamics of Computation
This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.
List of results
- Computational Complexity: A Modern Approach +
- STRAUSS: Spectral Transform Use in Stochastic Circuit Synthesis +
- Notes on the history of reversible computation +
- Elements of Information Theory +
- Information Theory, Inference and Learning Algorithms +
- Information, Physics, and Computation +
- Introduction to Automata Theory, Languages, and Computation +
- Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements +
- Time and space bounds for reversible simulation +
- On the complexity of the parity argument and other inefficient proofs of existence +
- An introduction to thermodynamics and statistical mechanics +
- Low-Power Digital Systems Based on Adiabatic-Switching Principles +
- Helical logic +
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation +
- End of Moore's law: Thermal (noise) death of integration in micro and nano electronics +
- Polynomial time algorithms for discrete logarithms and factoring on a quantum computer +
- Power- constrained CMOS scaling limits +
- Quantum mechanical computers +
- Experimental demonstration of a latch in clocked quantum-dot cellular automata +
- Reversibility for efficient computing +
- Asymptotically Zero Energy Computing Split-Level Charge Recovery Logic +
- Reversible electronic logic using switches +
- A fast quantum mechanical algorithm for database search +
- Classical and quantum limitations on energy consumption in computation +
- Reversible space equals deterministic space +
- On the Complexity of a Concentrator +
- Hard examples for resolution +
- Noise stability of functions with low influences: Invariance and optimality +
- Improved decoding of reed-solomon and algebraic-geometry codes +
- Explicit Constructions of Concentrators +
- The intractability of resolution +
- Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes +
- On the hardness of approximate reasoning +
- Word problems requiring exponential time (Preliminary Report) +
- Polynomial-Time Approximation Algorithms for the Ising Model +
- The complexity of facets (and some facets of complexity) +
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries +
- One way functions and pseudorandom generators +
- A complete problem for statistical zero knowledge +
- On the hardness of approximating minimization problems +
- Lower bounds for polynomial calculus: Non-binomial case +
- Expanders, randomness, or time versus space: Extended abstract +
- Combinatorial Problems and Exercises +
- The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l 1 +
- Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? +
- On Computable Numbers, With Application to the Entscheidungs Problem +
- Precis of The Emperor's New Mind +
- Communication lower bounds using directional derivatives +
- Efficient checking of computations +
- Pseudorandomness and average-case complexity via uniform reductions +