A. Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-Dec. 1982. Also in [27, pages 47--65].  Home/Search   Document Not in Database   Summary   Related Articles   Check

....improved to S Delta T 2 m 1:5 n :5 log O(1) n [BF93] A long term goal is to prove a matching lower bound. Proving lower bounds for a general model of computation, such as a Turing machine, is beyond the reach of the current techniques. Thus it is natural to consider a structured model [Bo82], whose basic operations are based on the structure of the graph, as opposed to being based on the bits in the graph s encoding. A natural structured model is the JAG ( jumping automaton for graphs ) introduced by Cook and Rackoff [CR80] It has a set of states and a limited supply of labeled ....

Allan Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-December 1982.

....et al. are tight. Unfortunately, proving non trivial lower bounds for natural decision problems on any general model of computation, such as Turing machines and branching programs appears to be beyond the reach of current techniques. Thus, it is natural to consider structured computational models [Bor82] whose basic operations are based on the structure of the input, as opposed to being based on the bits in the input s encoding. A natural structured model for stcon is the jumping automaton for graphs , or JAG, introduced by Cook and Rackoff [CR80] A JAG moves a set of pebbles on the graph. ....

Allan Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-December 1982. Also in [L'E82, pages 47--65].

....the type of information about the input that it is allowed to access. In addition, some of its workspace is structured to contain only a certain type of information. As well, its basic operations are based on the structure of the graph, as opposed to being based on the bits in the graph s encoding [Bo82]. Hence, it is referred to as a structured model of computation. The JAG model has a set of pebbles representing node names that a structured algorithm might record in its workspace. They are useful for marking certain nodes temporarily, so that it can be recognized when other pebbles reach ....

Allan Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-December 1982.

....time and space requirements of algorithms for directed connectivity. Proving lower bounds on the time or space requirements of stcon for a general model of computation, such as a Turing machine, is beyond the reach of current techniques. Thus, it is natural to consider a structured model [4] whose basic operations are based on the structure of the graph, as opposed to being based on the bits in the graph s encoding. A natural structured model for the problem of s t connectivity is the jumping automaton for graphs , or JAG, introduced by Cook and Rackoff [8] A JAG moves a set of ....

A. Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-Dec. 1982.

....tradeoff that closely matches these upper bounds. Although it would be desirable to show a tradeoff for a general model of computation such as a random access machine, obtaining such a tradeoff is beyond the reach of current techniques. Thus it is natural to consider a structured model (Borodin [14]) that is, one whose basic move is based on the adjacencies of the graph, as opposed to one whose basic move is based on the bits in the graph s encoding. An appropriate structured model for proving such a tradeoff is some variant of the JAG ( jumping automaton for graphs ) of Cook and Rackoff ....

A. Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-Dec. 1982. Also in [27, pages 47--65].

....tradeoff that closely matches these upper bounds. Although it would be desirable to show a tradeoff for a general model of computation such as a random access machine, obtaining such a tradeoff is beyond the reach of current techniques. Thus it is natural to consider a structured model (Borodin [16]) that is, one whose basic move is based on the adjacencies of the graph, as opposed to one whose basic move is based on the bits in the graph s encoding. An appropriate structured model for proving such a tradeoff is some variant of the JAG ( jumping automaton for graphs ) of Cook and Rackoff ....

A. Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-Dec. 1982. Also in [39, pages 47--65].

....tradeoff that closely matches these upper bounds. Although it would be desirable to show a tradeoff for a general model of computation such as a random access machine, obtaining such a tradeoff is beyond the reach of current techniques. Thus it is natural to consider a structured model (Borodin [12]) that is, one whose basic move is based on the adjacencies of the graph, as opposed to one whose basic move is based on the bits in the graph s encoding. An appropriate structured model for proving such a tradeoff is some variant of the JAG ( jumping automaton for graphs ) of Cook and Rackoff ....

A. Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-Dec. 1982. Also in [29, pages 47--65].

No context found.

Allan Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-December 1982. Also in [L'E82, pages 47--65].

No context found.

Allan Borodin. Structured vs. general models in computational complexity. L'Enseignement Math'ematique, XXVIII(3-4):171--190, July-December 1982. Also in [L'E82, pages 47--65].

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC