<--- Back to Details
First PageDocument Content
Graph theory / Property testing / Computational complexity theory / Locally testable code / Graph property / Representation / Function / Time complexity / Algorithm / Mathematics / Theoretical computer science / Applied mathematics
Date: 2010-07-22 08:07:13
Graph theory
Property testing
Computational complexity theory
Locally testable code
Graph property
Representation
Function
Time complexity
Algorithm
Mathematics
Theoretical computer science
Applied mathematics

A Brief Introduction to Property Testing Oded Goldreich

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Download Document from Source Website

File Size: 82,62 KB

Share Document on Facebook

Similar Documents

„ ´ Strengthening Erdos–Posa Property for Minor-Closed Graph Classes Fedor V. Fomin,1 Saket Saurabh,2 and Dimitrios M. Thilikos3

DocID: 1sVvX - View Document

Graph theory / Mathematics / Morphisms / Graph minor / Planar graph / Graph isomorphism problem / Graph property / Graph isomorphism / Planar cover / Graph homomorphism / Line graph / Book:Graph Theory

CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   LOCALLY INJECTIVE HOMOMORPHISMS

DocID: 1r5we - View Document

Graph theory / Mathematics / Graph operations / NP-complete problems / Graph coloring / Topological graph theory / Line graph / Graph homomorphism / Graph / Graph property / Signed graph

A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar

DocID: 1r2yt - View Document

Graph theory / Mathematics / Discrete mathematics / AanderaaKarpRosenberg conjecture / Planar graph / Graph property / Graph / Logic of graphs / Triangle-free graph

Decision Tree Complexity, Solvable Groups, and the Distribution of Prime Numbers Joint Work 2010 L´

DocID: 1qB9m - View Document

Algebra / Mathematics / Matrices / Linear algebra / Algebraic graph theory / Operator theory / Functional analysis / Laplacian matrix / Matrix / Linear subspace / Collinearity

A Note on Boundary Constraints for Linear Variational Surface Design Andrew Nealen TU Berlin Abstract This note presents a proof for the subspace property of linear variational methods for fair surface design. Specifical

DocID: 1qg2D - View Document