2877 search results - page 67 / 576 » The Complexity of Planarity Testing |
FORTE
1997
13 years 10 months ago
1997
Distributed programming and object-oriented programming are two popular programming paradigms. The former is driven by advances in networking technology whereas the latter provide...
DSD
2002
IEEE
14 years 2 months ago
2002
IEEE
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...
COCO
2000
Springer
14 years 21 days ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
OOPSLA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract—The Internet houses diverse applications (i.e., banking, networking, etc.), commonly implemented as web services. Web services are flexible but can become complex, maki...
COCO
2001
Springer
14 years 1 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...