Search results
From MaRDI portal
- Paper Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines 1985-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3715103...10 bytes (15 words) - 03:34, 9 December 2023
- One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract) 2009-12-17 Paper Theory of one-tape linear-time Turing machines 2009-12-01 Paper...10 bytes (13 words) - 12:35, 7 October 2023
- Publication Date of Publication Type Attribute based encryption for Turing machines from lattices 2024-12-13 Paper Signature for objects: formalizing how...10 bytes (13 words) - 18:33, 24 September 2023
- language recognition on alternating machines 1989-01-01 Paper A leaf-time hierarchy of two-dimensional alternating turing machines 1989-01-01 Paper https://portal...10 bytes (15 words) - 05:44, 9 December 2023
- Paper Physical oracles: the Turing machine and the Wheatstone bridge 2010-12-01 Paper Computational complexity with experiments as oracles. II. Upper bounds...10 bytes (15 words) - 23:41, 24 September 2023
- without machines: on complete languages for UP 1988-01-01 Paper The Boolean Hierarchy I: Structural Properties 1988-01-01 Paper On sparse oracles separating...10 bytes (15 words) - 14:10, 6 December 2023
- Paper A comparison of polynomial time reducibilities 1975-01-01 Paper Turing machines and the spectra of first-order formulas 1974-01-01 Paper https://portal...10 bytes (17 words) - 14:16, 6 December 2023
- rank 2003-08-26 Paper A note on square rooting of time functions of Turing machines 2003-08-26 Paper The complexity of counting self-avoiding walks in subgraphs...10 bytes (13 words) - 14:16, 6 December 2023
- https://doi.org/10.1016/0022-0000(85)90053-4 zbMATH Keywords nondeterministic oracle Turing machine Mathematics Subject Classification ID Complexity of computation...15 bytes (343 words) - 23:39, 30 January 2024
- observations concerning alternating Turing machines using small space On eliminating nondeterminism from Turing machines which use less than logarithm worktape...15 bytes (690 words) - 05:35, 31 January 2024
- classes of nondeterministic and alternating Turing machines On the complexity of 2-output Boolean networks Improved simulation of nondeterministic Turing machines...15 bytes (708 words) - 12:49, 6 February 2024
- Probabilistic Space-Bounded Machines with Multiple Access to Random Tape The generation of random numbers that are probably prime Turing machines with few accepting...15 bytes (865 words) - 09:42, 6 February 2024
- of pseudorandom generators A Turing machine time hierarchy On relationships between complexity classes of Turing machines Alternating time versus deterministic...15 bytes (475 words) - 09:49, 6 February 2024
- Tape-bounded Turing acceptors and principal AFLs Complete sets and the polynomial-time hierarchy Computational complexity of multitape Turing machines and random...15 bytes (350 words) - 04:57, 3 February 2024
- Functions with a Random Oracle Space-bounded hierarchies and probabilistic computations Log space machines with multiple oracle tapes Complexity-theoretic...15 bytes (648 words) - 07:34, 6 February 2024
- deterministic polynomial space-bounded oracle machineslanguages accepted by nondeterministic polynomial space-bounded oracle machines Mathematics Subject Classification...15 bytes (287 words) - 04:39, 31 January 2024
- relativized log space Log space machines with multiple oracle tapes Space-bounded simulation of multitape turing machines Parallel computation and the NC...15 bytes (446 words) - 02:16, 31 January 2024
- Malament–Hogarth Spacetimes Infinite time Turing machines Analytic machines Relativistic computers and the Turing barrier Logical Approaches to Computational...15 bytes (355 words) - 10:20, 30 January 2024
- Proof Theory Bounded query machines: on NP and PSPACE Relativized circuit complexity With probability one, a random oracle separates PSPACE from the polynomial-time...15 bytes (849 words) - 06:05, 6 February 2024
- algorithms and problem complexity (68Q25) Turing machines and related notions (03D10) Cited In (88) On Goles' universal machines: a computational point of view Accurate...15 bytes (793 words) - 09:49, 6 February 2024
