scientific article; zbMATH DE number 1033441

Publication date: 14 July 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational complexity VLSI model for integrated circuits

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of software (68N99)

Related Items (max. 100)

Time-space trade-offs for triangulations and Voronoi diagrams ⋮ The delay of circuits whose inputs have specified arrival times ⋮ Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ Cumulative Space in Black-White Pebbling and Resolution ⋮ The stochastic thermodynamics of computation ⋮ Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study ⋮ On methods of shortening ElGamal-type signatures ⋮ Delay optimization of linear depth Boolean circuits with prescribed input arrival times ⋮ Polynomial equation solving by lifting procedures for ramified fibers ⋮ Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ A bridging model for multi-core computing ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ The cost of adaptivity in security games on graphs ⋮ Upper and lower I/O bounds for pebbling $r$-pyramids ⋮ The depth of resolution proofs ⋮ On the bit complexity of polynomial system solving ⋮ Upper and Lower I/O Bounds for Pebbling r-Pyramids ⋮ VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH ⋮ Secure computation without computers ⋮ One-way permutations, computational asymmetry and distortion. ⋮ Parameterizing by the number of numbers ⋮ THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M_{k, 1} AND THEIR COMPLEXITY ⋮ On the computational power of circuits of spiking neurons ⋮ Is Universal Computation a Myth? ⋮ On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism ⋮ Transition Function Complexity of Finite Automata ⋮ Accelerating machines: a review ⋮ Randomized semantic games for fuzzy logics ⋮ Index-based, high-dimensional, cosine threshold querying with optimality guarantees ⋮ A $c^k n$ 5-Approximation Algorithm for Treewidth ⋮ Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Synchronizing Automata over Nested Words ⋮ Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations ⋮ Forest resampling for distributed sequential Monte Carlo ⋮ CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS ⋮ The word problem of the Brin-Thompson group is \textsf{coNP}-complete ⋮ Boolean circuit programming: A new paradigm to design parallel algorithms ⋮ On Negations in Boolean Networks ⋮ Abstract quantum computing machines and quantum computational logics ⋮ Deformation techniques for sparse systems ⋮ Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths ⋮ Reviewing bounds on the circuit size of the hardest functions ⋮ Fast computation of a rational point of a variety over a finite field ⋮ Neural circuits for pattern recognition with small total wire length. ⋮ Expressiveness of matchgates. ⋮ Space bounds for resolution ⋮ From finite automata to fractal automata -- the power of recursion

This page was built for publication: