The following pages link to Yuri Gurevich (Q293302):
Displayed 50 items.
- (Q3059192) (← links)
- (Q3129297) (← links)
- Randomizing Reductions of Search Problems (Q3142587) (← links)
- (Q3152801) (← links)
- Primal Infon Logic with Conjunctions as Sets (Q3190165) (← links)
- On Quantum Computation, Anyons, and Categories (Q3305322) (← links)
- Random models and the Gödel case of the decision problem (Q3317081) (← links)
- Rabin's uniformization problem (Q3322069) (← links)
- On the unique satisfiability problem (Q3331209) (← links)
- Equivalence Relations, Invariants, and Normal Forms (Q3334985) (← links)
- (Q3334986) (← links)
- The inference problem for template dependencies (Q3340200) (← links)
- The monadic theory of <i>ω</i><sub>2</sub> (Q3342531) (← links)
- Interpreting second-order logic in the monadic theory of order (Q3347854) (← links)
- (Q3384927) (← links)
- (Q3395946) (← links)
- (Q3395980) (← links)
- (Q3396012) (← links)
- (Q3396607) (← links)
- (Q3396617) (← links)
- (Q3396639) (← links)
- (Q3397633) (← links)
- A geometric zero-one law (Q3399185) (← links)
- Play to Test (Q3434603) (← links)
- Optimal ancilla-free Pauli+V circuits for axial rotations (Q3463254) (← links)
- On the strength of the interpretation method (Q3476808) (← links)
- Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space (Q3477959) (← links)
- Proving Church’s Thesis (Q3499760) (← links)
- Exact Exploration and Hanging Algorithms (Q3586039) (← links)
- One Useful Logic That Defines Its Own Truth (Q3599112) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- When are Two Algorithms the Same? (Q3633205) (← links)
- (Q3661557) (← links)
- Monadic theory of order and topology in ZFC (Q3663256) (← links)
- A decidable subclass of the minimal Gödel class with identity (Q3695254) (← links)
- The decision problem for branching time logic (Q3708772) (← links)
- The word problem for cancellation semigroups with zero (Q3712329) (← links)
- A logic for constant-depth circuits (Q3722427) (← links)
- A zero-one law for logic with a fixed-point operator (Q3747760) (← links)
- (Q3757893) (← links)
- (Q3758820) (← links)
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (Q3766845) (← links)
- Definability by constant-depth polynomial-size circuits (Q3767263) (← links)
- Monotone versus positive (Q3778681) (← links)
- On the number of active nodes in a multicomputer system (Q3783494) (← links)
- (Q3791123) (← links)
- Expected Computation Time for Hamiltonian Path problem (Q3801093) (← links)
- (Q3811701) (← links)
- (Q3826533) (← links)
- (Q3838767) (← links)