The following pages link to Arie Matsliah (Q452854):
Displaying 24 items.
- Monotonicity testing and shortest-path routing on the cube (Q452855) (← links)
- Hardness and algorithms for rainbow connection (Q491198) (← links)
- Underapproximation for model-checking based on universal circuits (Q963058) (← links)
- Learning parities in the mistake-bound model (Q1944027) (← links)
- Nearly Tight Bounds for Testing Function Isomorphism (Q2840979) (← links)
- On Efficient Computation of Variable MUSes (Q2843335) (← links)
- Perfect Hashing and CNF Encodings of Cardinality Constraints (Q2843343) (← links)
- New Results on Quantum Property Testing (Q2908845) (← links)
- On the power of conditional samples in distribution testing (Q2986902) (← links)
- Efficient Sample Extractors for Juntas with Applications (Q3012831) (← links)
- On the query complexity of testing orientations for being Eulerian (Q3189056) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- Testing graph isomorphism (Q3581491) (← links)
- Monotonicity Testing and Shortest-Path Routing on the Cube (Q3588427) (← links)
- Testing st-Connectivity (Q3603479) (← links)
- Testing Graph Isomorphism (Q3614155) (← links)
- (Q5365148) (← links)
- Hardness and Algorithms for Rainbow Connectivity (Q5389981) (← links)
- Approximate Hypergraph Partitioning and Applications (Q5390591) (← links)
- (Q5414625) (← links)
- Underapproximation for Model-Checking Based on Random Cryptographic Constructions (Q5429328) (← links)
- (Q5497116) (← links)
- Sound 3-Query PCPPs Are Long (Q5892181) (← links)
- Sound 3-Query PCPPs Are Long (Q5900244) (← links)
