The following pages link to Eldar Fischer (Q178699):
Displaying 50 items.
- Hardness and algorithms for rainbow connection (Q491198) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- Testing juntas (Q598252) (← links)
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- Cycle factors in dense graphs (Q1292839) (← links)
- The Specker-Blatter theorem does not hold for quaternary relations (Q1399912) (← links)
- Induced complete \(h\)-partite graphs in dense clique-less graphs (Q1808156) (← links)
- On the strength of comparisons in property testing (Q1887149) (← links)
- 2-factors in dense graphs (Q1917480) (← links)
- Improving and extending the testing of distributions for shape-restricted properties (Q2319645) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- (Q2761012) (← links)
- (Q2768393) (← links)
- PCP characterizations of NP (Q2819531) (← links)
- Testing Formula Satisfaction (Q2904572) (← links)
- New Results on Quantum Property Testing (Q2908845) (← links)
- A combinatorial characterization of the testable graph properties (Q2931390) (← links)
- On the power of conditional samples in distribution testing (Q2986902) (← links)
- Partial tests, universal tests and decomposability (Q2988902) (← links)
- (Q3002771) (← links)
- Approximate Satisfiability and Equivalence (Q3068633) (← links)
- The Specker-Blatter Theorem Revisited (Q3082916) (← links)
- Inflatable Graph Properties and Natural Property Tests (Q3088125) (← links)
- Two-phase algorithms for the parametric shortest path problem (Q3113746) (← links)
- (Q3118380) (← links)
- (Q3152421) (← links)
- On the query complexity of testing orientations for being Eulerian (Q3189056) (← links)
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs (Q3507528) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- Monotonicity testing over general poset domains (Q3579209) (← links)
- The difficulty of testing for isomorphism against a graph that is given in advance (Q3580984) (← links)
- Testing versus estimation of graph properties (Q3581386) (← links)
- Testing graph isomorphism (Q3581491) (← links)
- Testing Convexity Properties of Tree Colorings (Q3590927) (← links)
- Testing st-Connectivity (Q3603479) (← links)
- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects (Q3603487) (← links)
- Testing Graph Isomorphism (Q3614155) (← links)
- Variants of the Hajnal-Szemer�di Theorem (Q4261183) (← links)
- Functions that have read‐twice constant width branching programs are not necessarily testable (Q4459589) (← links)
- (Q4607989) (← links)
- Improving and extending the testing of distributions for shape-restricted properties (Q4636629) (← links)
- (Q4668732) (← links)
- Testing graphs for colorability properties* (Q4680410) (← links)
- Testing Read-Once Formula Satisfaction (Q4973849) (← links)
- Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
- Testing of matrix properties (Q5175981) (← links)
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity (Q5189542) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance (Q5317189) (← links)
