The following pages link to Jacobo Toran (Q1114674):
Displaying 50 items.
- (Q198258) (redirect page) (← links)
- (Q294650) (redirect page) (← links)
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- Reductions to graph isomorphism (Q987394) (← links)
- A combinatorial characterization of treelike resolution space (Q1014444) (← links)
- On counting and approximation (Q1114675) (← links)
- Turing machines with few accepting computations and low sets for PP (Q1190987) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- Cops-robber games and the resolution of Tseitin formulas (Q1656588) (← links)
- Space bounds for resolution (Q1854472) (← links)
- The power of the middle bit of a \(\#\)P function (Q1894453) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
- Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
- Parameterized complexity of small weight automorphisms and isomorphisms (Q2067668) (← links)
- Corrigendum to ``Completeness results for graph isomorphism'' (Q2495413) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q2670923) (← links)
- (Q2743691) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism (Q2817999) (← links)
- A Tutorial on Time and Space Bounds in Tree-Like Resolution (Q2821700) (← links)
- Graph Isomorphism is not AC 0 reducible to Group Isomorphism (Q2908861) (← links)
- Solving Linear Equations Parameterized by Hamming Weight (Q2946006) (← links)
- Solvable Group Isomorphism Is (Almost) in NP ∩ coNP (Q2947552) (← links)
- Graph Isomorphism is Not AC0-Reducible to Group Isomorphism (Q2947584) (← links)
- Classes of bounded nondeterminism (Q3034815) (← links)
- Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs (Q3113751) (← links)
- Paradigms for Fast Parallel Approximability (Q3184627) (← links)
- Self-reducible sets of small density (Q3210176) (← links)
- (Q3359759) (← links)
- (Q3396000) (← links)
- (Q3396558) (← links)
- (Q3633739) (← links)
- On the complexity of computable real sequences (Q3773335) (← links)
- (Q3800016) (← links)
- (Q3974851) (← links)
- Paradigms for Fast Parallel Approximability (Q4229814) (← links)
- (Q4251059) (← links)
- (Q4251071) (← links)
- (Q4258575) (← links)
- (Q4259996) (← links)
- (Q4273947) (← links)
- (Q4281499) (← links)
- Complexity classes defined by counting quantifiers (Q4302854) (← links)
- (Q4359460) (← links)
