Property testing is a rapid growing field in theoretical computer science. It considers the following task: given a function f over a domain D, a property ℘ and a parameter 00, and present the first property tester for tree-likeness of quartet topologies. Our property tester makes at most O(n 3/ε) queries, and is of one-sided error and non-adaptive.補正完
We begin in this section with a brief introduction to the field of property testing. Section 2 expla...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Property testers are efficient, randomized algorithms which recognize if an input graph (or other co...
Property testing considers the following task: given a function ψ over a domain D, a property P and ...
Property Testing is the study of super-efficient algorithms that solve "approximate decision pr...
Broadly, property testing is the study of the following class of problems: Given the ability to perf...
Property testing is a relaxation of classical decision problems which aims at distinguishing between...
Abstract. We show that for all integers t ≥ 8 and arbitrarily small > 0, there exists a graph pro...
Adaptivity is known to play a crucial role in property testing. In particular, there exist propertie...
The standard definition of property testing endows the tester with the ability to make ar-bitrary qu...
Property testing deals with the following relaxation of decision problems: Given a property P and an...
Our framework allows us to analyze all our testers ina unified way and the obtained complexity bound...
I will describe recent work on the multi-party (number-in-hand) communication complexity of property...
Property testers are randomised sublinear time algorithms which infer global structure from a local...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We begin in this section with a brief introduction to the field of property testing. Section 2 expla...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Property testers are efficient, randomized algorithms which recognize if an input graph (or other co...
Property testing considers the following task: given a function ψ over a domain D, a property P and ...
Property Testing is the study of super-efficient algorithms that solve "approximate decision pr...
Broadly, property testing is the study of the following class of problems: Given the ability to perf...
Property testing is a relaxation of classical decision problems which aims at distinguishing between...
Abstract. We show that for all integers t ≥ 8 and arbitrarily small > 0, there exists a graph pro...
Adaptivity is known to play a crucial role in property testing. In particular, there exist propertie...
The standard definition of property testing endows the tester with the ability to make ar-bitrary qu...
Property testing deals with the following relaxation of decision problems: Given a property P and an...
Our framework allows us to analyze all our testers ina unified way and the obtained complexity bound...
I will describe recent work on the multi-party (number-in-hand) communication complexity of property...
Property testers are randomised sublinear time algorithms which infer global structure from a local...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We begin in this section with a brief introduction to the field of property testing. Section 2 expla...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Property testers are efficient, randomized algorithms which recognize if an input graph (or other co...
DOI
Add to ORKG