Sciweavers

1507 search results - page 5 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
112
Voted
ECCC
2000
75views more  ECCC 2000»
15 years 11 days ago
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
Andreas Klein, Martin Kutrib
105
Voted
COCO
1995
Springer
113views Algorithms» more  COCO 1995»
15 years 4 months ago
On the Structure of Low Sets
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
Johannes Köbler
ICECCS
1997
IEEE
102views Hardware» more  ICECCS 1997»
15 years 4 months ago
Problem complexity
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because ...
Michael Jackson
CCCG
2004
15 years 1 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 7 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef