57 search results - page 3 / 12 » Hierarchy Theorems for Property Testing |
TCS
2008
13 years 8 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
LFCS
1997
Springer
14 years 21 days ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...
JAR
2000
13 years 8 months ago
2000
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
TAP
2010
Springer
13 years 6 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...