scientific article; zbMATH DE number 1033441
From MaRDI portal
Publication:4344138
Recommendations
Cited in
(64)- Boolean circuit programming: A new paradigm to design parallel algorithms
- Deformation techniques for sparse systems
- Reviewing bounds on the circuit size of the hardest functions
- Time-space trade-offs for triangulations and Voronoi diagrams
- On the bit complexity of polynomial system solving
- On the computational power of circuits of spiking neurons
- Neural circuits for pattern recognition with small total wire length.
- Expressiveness of matchgates.
- Space bounds for resolution
- Randomized semantic games for fuzzy logics
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
- From finite automata to fractal automata -- the power of recursion
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete
- The delay of circuits whose inputs have specified arrival times
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- The cost of adaptivity in security games on graphs
- Formal models of computation. The ultimate limits of computing
- A c^k n 5-approximation algorithm for treewidth
- Synchronizing automata over nested words
- Robust memory-aware mappings for parallel multifrontal factorizations
- Abstract quantum computing machines and quantum computational logics
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Upper and lower I/O bounds for pebbling \(r\)-pyramids
- Fast computation of a rational point of a variety over a finite field
- Time-space trade-offs for triangulations and Voronoi diagrams
- The \(\mathcal R\)- and \(\mathcal L\)-orders of the Thompson-Higman monoid \(M_{k,1}\) and their complexity.
- On Negations in Boolean Networks
- Upper and lower I/O bounds for pebbling \(r\)-pyramids
- scientific article; zbMATH DE number 1760031 (Why is no real title available?)
- Cumulative space in black-white pebbling and resolution
- Is universal computation a myth?
- On computable numbers, nonuniversality, and the genuine power of parallelism
- Vertex isoperimetric parameter of a computation graph
- Forest resampling for distributed sequential Monte Carlo
- The stochastic thermodynamics of computation
- On methods of shortening ElGamal-type signatures
- Secure computation without computers
- Transition function complexity of finite automata
- Accelerating machines: a review
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
- New Computational Paradigms
- 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
- Computability and complexity theory.
- The depth of resolution proofs
- Cryptanalysis of algebraic verifiable delay functions
- Design and implementation of multi-threaded algorithms in polynomial algebra
- Linear-size Boolean circuits for multiselection
- Fractal automata: recursion in context-free and in deterministic and linear context-free languages
- Randomized vs. deterministic separation in time-space tradeoffs of multi-output functions
- A VLSI circuit model accounting for wire delay
- Understanding the thermodynamics of computation: a pedagogical overview
- Proving as fast as computing: succinct arguments with constant prover overhead
- Pebble games and algebraic proof systems
- Pebble games and algebraic proof systems
- Card-based protocols imply PSM protocols
- On languages of transduced-input finite automata with translucent letters
- Delay optimization of linear depth Boolean circuits with prescribed input arrival times
- One-way permutations, computational asymmetry and distortion.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344138)
