Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • sub-linear space computation, and the linear space hypothesis 2019-11-07 Paper Supportive oracles for parameterized polynomial-time sub-linear-space computations...
    10 bytes (16 words) - 13:35, 7 October 2023
  • networks 2015-09-04 Paper Deterministic polynomial approach in the plane 2015-07-08 Paper How to Meet Asynchronously at Polynomial Cost 2015-06-24 Paper MINIMIZING...
    10 bytes (17 words) - 18:14, 9 December 2023
  • networks with multiple busses 2022-08-18 Paper On genuinely time bounded computations 2022-08-16 Paper Time-optimal simulations of networks by universal...
    10 bytes (23 words) - 15:24, 10 December 2023
  • pigeonhole principle 2005-07-05 Paper Deterministic polynomial identity testing in non-commutative models 2005-06-16 Paper Bounded-Depth Frege Lower Bounds for...
    10 bytes (16 words) - 10:53, 8 December 2023
  • Paper Space-bounded hierarchies and probabilistic computations 1984-01-01 Paper On uniform circuit complexity 1981-01-01 Paper Tree-size bounded alternation...
    10 bytes (19 words) - 11:08, 24 September 2023
  • for Bin Packing 2012-07-16 Paper Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP 2012-07-16 Paper...
    10 bytes (16 words) - 00:36, 11 December 2023
  • Searching with increasing speeds 2023-08-02 Paper Fast deterministic simulation of computations on faulty parallel machines 2023-05-08 Paper Efficient...
    10 bytes (18 words) - 18:22, 9 December 2023
  • recognition of deterministic CFLs in small time and space 1983-01-01 Paper Parallel computation for well-endowed rings and space-bounded probabilistic machines...
    10 bytes (19 words) - 17:38, 12 December 2023
  • 2004 2007-10-01 Paper Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines 2007-06-26 Paper Time-space tradeoff in derandomizing...
    10 bytes (18 words) - 13:05, 11 December 2023
  • communication complexity, finite automata, and polynomial-time computations 2022-11-09 Paper A nonlinear lower bound on the practical combinational complexity...
    10 bytes (17 words) - 06:44, 9 December 2023
  • and alternating decision trees 1985-01-01 Paper Space-bounded hierarchies and probabilistic computations 1984-01-01 Paper The Effect of Number of Hamiltonian...
    10 bytes (16 words) - 11:08, 24 September 2023
  • logic elements 2015-01-28 Paper Reversibility in space-bounded computation 2014-11-19 Paper Computation in reversible cellular automata 2014-01-06 Paper...
    10 bytes (17 words) - 03:30, 9 December 2023
  • algorithms for 1-space bounded multidimensional bin packing and hypercube packing 2013-08-02 Paper Online Algorithms for 1-Space Bounded 2-Dimensional Bin...
    10 bytes (17 words) - 21:31, 9 December 2023
  • de/entity/Q4228448 1999-05-18 Paper Log-Space Polynomial End-to-End Communication 1998-09-21 Paper Computational Complexity and Knowledge Complexity 1998-09-20...
    10 bytes (17 words) - 16:42, 7 December 2023
  • constants of univariate polynomial spaces 2018-08-24 Paper Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity...
    10 bytes (19 words) - 11:47, 8 December 2023
  • Paper On the Computational Complexity of Small Descriptions 1994-11-13 Paper A positive relativization of polynomial time versus polylog space 1993-10-03...
    10 bytes (17 words) - 02:35, 12 December 2023
  • solutions: efficient solutions with bounded trade-offs 2016-05-17 Paper On Efficient Solutions with Trade-Offs Bounded by Given Values 2016-03-18 Paper Slater...
    10 bytes (18 words) - 14:37, 10 December 2023
  • impossibility of deterministic poly-space simulation 1986-01-01 Paper There is no polynomial deterministic space simulation of probabilistic space with a two-way...
    10 bytes (17 words) - 12:40, 28 January 2024
  • Paper On efficient parallel computations for some dynamic programming problems 1988-01-01 Paper On efficient parallel computations of costs of paths on a grid...
    10 bytes (17 words) - 18:22, 9 December 2023
  • to complexity theory 2016-09-01 Paper Polynomial-time algorithm for the orbit problem 2016-01-04 Paper Time-space lower bounds for satisfiability 2015-12-04...
    10 bytes (19 words) - 18:41, 8 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)