The following pages link to (Q4344138):
Displaying 49 items.
- Upper and lower I/O bounds for pebbling \(r\)-pyramids (Q450538) (← links)
- Secure computation without computers (Q517015) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- A bridging model for multi-core computing (Q619912) (← links)
- Computability and complexity theory. (Q640476) (← links)
- The depth of resolution proofs (Q647405) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Delay optimization of linear depth Boolean circuits with prescribed input arrival times (Q866541) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Reviewing bounds on the circuit size of the hardest functions (Q1041784) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- On the computational power of circuits of spiking neurons (Q1765301) (← links)
- Neural circuits for pattern recognition with small total wire length. (Q1853469) (← links)
- Expressiveness of matchgates. (Q1853537) (← links)
- Space bounds for resolution (Q1854472) (← links)
- Randomized semantic games for fuzzy logics (Q2035339) (← links)
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees (Q2035468) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths (Q2074348) (← links)
- From finite automata to fractal automata -- the power of recursion (Q2104137) (← links)
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete (Q2306657) (← links)
- The delay of circuits whose inputs have specified arrival times (Q2370422) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q2670923) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations (Q2815696) (← links)
- Abstract quantum computing machines and quantum computational logics (Q2830245) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Upper and Lower I/O Bounds for Pebbling r-Pyramids (Q3000499) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M<sub>k, 1</sub> AND THEIR COMPLEXITY (Q3580222) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Is Universal Computation a Myth? (Q4686642) (← links)
- On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism (Q4686646) (← links)
- VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH (Q4902887) (← links)
- Forest resampling for distributed sequential Monte Carlo (Q4970195) (← links)
- The stochastic thermodynamics of computation (Q5053500) (← links)
- On methods of shortening ElGamal-type signatures (Q5071464) (← links)
- Transition Function Complexity of Finite Automata (Q5200100) (← links)
- Accelerating machines: a review (Q5451177) (← links)
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS (Q5470158) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q6162056) (← links)
