This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
203 Relational Queries Computable in Polynomial Time - Immerman (1986)(Correct)
We characterize the polynomial time computable queries as those expressible
in relational calculus plus a least fixed point operator and a total
ordering on the universe. We also show that even withou... / order predicate calculus computational complexity and least fixed points
200 vic: A Flexible Framework for Packet Video - McCanne, Van Jacobson (1995)(Correct)
The deployment of IP Multicast has fostered the development of a suite of applications, collectively known as the MBone tools, for real-time multimedia conferencingover the Internet. Two of these tool... / Because of its low computational complexity the nv codec can run br of the image. Finally computational complexity is further reduced by
193 Interior Point Methods In Semidefinite Programming With Applications.. - Alizadeh (1995)(Correct)
We study the semidefinite programming problem (SDP), i.e the optimization problem
of a linear function of a symmetric matrix subject to linear equality constraints and the additional
condition that ... / below and even structural computational complexity theory see The br reason their worst case computational complexity is likely to be at least
166 Languages That Capture Complexity Classes - Immerman (1987)(Correct)
this paper a series of languages adequate for expressing exactly
those properties checkable in a series of computational complexity classes. For
example, we show that a property of graphs (respectivel... / checkable in a series of computational complexity classes. For example we br First-Order Sentences and Computational Complexity SIAM J. of Comp.
162 Statistical properties of MPEG video traffic and their impact on.. - Rose (1995)(Correct)
MPEG video traffic is expected to cause several problems in ATM networks, both from
performance and from architectural viewpoint. For the solution of these difficulties,
appropriate video traffic mode... / The second reason is the computational complexity of simulations
147 A Correspondence Theory for Terminological Logics: Preliminary Report - Schild (1991)(Correct)
We show that the terminological logic ALC comprising Boolean operations
on concepts and value restrictions is a notational variant of the propositional
modal logic K (m) . To demonstrate the utility o... / mainly concerning the computational complexity of terminological logics. br in K m has the same computational complexity as coherence in ALC.
120 Using Linear Algebra for Intelligent Information Retrieval - Berry, Dumais, O'Brien (1995)(Correct)
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. B... / of query matching and computational complexity. Section surveys br Table Computational complexity of updating methods.
119 Visibility Preprocessing For Interactive Walkthroughs - Teller, Sequin (1991)(Correct)
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g., walls), only a smal... / difficulties and high computational complexity obstacles cell br effectiveness and computational complexity. All but the last method
116 The Computational Complexity of Propositional STRIPS Planning - Bylander (1994)(Correct)
I present several computational complexity results for propositional STRIPS planning, i.e.,
STRIPS planning restricted to ground formulas. Different planning problems can be defined
by restricting the... / The Computational Complexity of Propositional STRIPS br I present several computational complexity results for propositional
113 Decidable Reasoning in Terminological Knowledge Representation Systems - Buchheit, Donini, Schaerf (1993)(Correct)
Terminological knowledge representation systems (TKRSs) are tools for designing and
using knowledge bases that make use of terminological languages (or concept languages).
We analyze from a theoretica... / Recent research on the computational complexity of subsumption had an br Nutt Also beyond computational complexity pure subsumption was
109 Algorithms for Quantum Computation: Discrete Logarithms and Factoring - Shor (1994)(Correct)
A computer is generally considered to be a universal
computational device; i.e., it is believed able to simulate
any physical computational device with a increase in computation
time of at most a poly... / There are also other computational complexity classes discussed in br computation theory of computational complexity. One of the results
108 Automatic Symbolic Verification of Embedded Systems - Alur, Henzinger, Ho (1996)(Correct)
We present a model-checking procedure and its implementation for the automatic
verification of embedded systems. The system components are described as Hybrid
Automata---communicating machines with... / Although in theory the computational complexity of the verification
98 The Model Checker SPIN - Holzmann (1997)(Correct)
SPIN is an efficient verification system for models of distributed software systems. It has been used to detect design
errors in applications ranging from high-level descriptions of distributed algori... / The fundamental computational complexity of the problem to be
94 A Unified Approach to Interior Point Algorithms for Linear.. - Kojima, Megiddo, Noma, Yoshise (1991)(Correct)
This note summarizes a report with the same title, where a
study was carried out regarding a unified approach, proposed by Kojima, Mizuno
and Yoshise, for interior point algorithms for the linear co... / of the theoretical computational complexity of the UIP method. br for Evaluating the Computational Complexity. We assume all the
93 QoS Routing Mechanisms and OSPF Extensions - Guerin, Orda, Williams (1996)(Correct)
This paper presents and discusses path selection algorithms to support QoS routes in IP networks. The work is carried out in the context of extensions to the OSPF protocol, and the initial focus is on... / between accuracy and computational complexity. We also describe and br between accuracy computational complexity and ease of
92 Factoring Wavelet Transforms Into Lifting Steps - Daubechies, Sweldens (1996)(Correct)
This paper is essentially tutorial in nature. We show how any discrete wavelet
transform or two band subband filtering with finite filters can be decomposed into a finite
sequence of simple filterin... / asymptotically reduces the computational complexity of the transform by a br how lifting can reduce the computational complexity of the wavelet transform
90 A Parallel Hashed Oct-Tree N-Body Algorithm - Warren, Salmon (1993)(Correct)
We report on an efficient adaptive N-body method which we have recently designed and implemented. The algorithm computes the forces on an arbitrary distribution of bodies in a time which scales as N l... / expended to reduce the computational complexity of such simulations
88 Issues in Automated Negotiation and Electronic Commerce: Extending.. - Sandholm, Lesser (1995)(Correct)
In this paper we discuss a number of previously
unaddressed issues that arise in automated negotiation
among self-interested agents whose
rationality is bounded by computational complexity.
These issu... / rationality is bounded by computational complexity. These issues are br sometimes increases computational complexity more than the benefit
83 Toward Efficient Agnostic Learning - Kearns (1994)(Correct)
In this paper we initiate an investigation of generalizations of the Probably Approximately Correct (PAC) learning model that attempt to significantly weaken the target function assumptions. The ult... / a rigorous study of the computational complexity of learning as a function
80 Data Mining: An Overview from a Database Perspective - Chen, Han, Yu (1996)(Correct)
Mining information and knowledge from large databases has been recognized by many researchers as a key research topic in database systems and machine learning, and by many industrial companies as an i... / of data and the computational complexity of some data mining br both PAM and CLARA. The computational complexity of every iteration in
78 Optimizing Power Using Transformations - Chandrakasan, Potkonjak, Mehra.. (1995)(Correct)
The increasing demand for portable computing has elevated power consumption to be one of the most critical design parameters. A high-level synthesis system, HYPER-LP, is presented for minimizing pow... / with varying degree of computational complexity and structures are br these approaches is the computational complexity vs. accuracy.
78 Elementary gates for quantum computation - Barenco, Bennett, Cleve, Di.. (1995)(Correct)
We show that a set of gates that consists of all one-bit quantum gates (U(2))
and the two-bit exclusive-or gate (that maps Boolean values (x; y) to (x; x \Phi y))
is universal in the sense that all u... / studied in conventional computational complexity theory. It consists of
70 On The Length Of Programs For Computing Finite Binary Sequences.. - Chaitin (1969)(Correct)
An attempt is made to carry out a program (outlined in a previous paper) for defining the concept of a random or patternless, finite binary sequence, and for subsequently defining a random or patternl... / Key Words and Phrases computational complexity sequences random
66 Gap-Definable Counting Classes - Fenner, Fortnow, Kurtz (1992)(Correct)
The function class #P lacks an important closure property: it is not closed under subtraction.
To remedy this problem, we introduce the function class GapP as a natural alternative to #P.
GapP is the ... / with the basic concepts of computational complexity theory including Turing br complexity theory. Computational Complexity - . A
62 Training Models of Shape from Sets of Examples - Cootes, Taylor, Cooper, Graham (1992)(Correct)
A method for building flexible shape models is presented in which a shape is represented by a set of labelled points. The technique determines the statistics of the points over a collection of example... / meters. The method has computational complexity O n where n br and offers O n computational complexity. Image interpretation
62 Wavelet Radiosity - Gortler, Schröder, Cohen, Hanrahan (1993)(Correct)
Radiosity methods have been shown to be an effective means
to solve the global illumination problem in Lambertian diffuse
environments. These methods approximate the radiosity integral
equation by pro... / has attempted to lower the computational complexity of solving the linear
61 Neural Network Exploration Using Optimal Experiment Design - Cohn (1994)(Correct)
We consider the question "How should one act when the only goal is to learn as much as possible?" Building
on the theoretical results of Fedorov [1972] and MacKay [1992], we apply techniques from Opti... / sharply reduce worst case computational complexity from NP-complete to br the performance and computational complexity of this task in greater
61 Belief Revision and Default Reasoning: Syntax-Based Approaches - Nebel (1991)(Correct)
Belief revision leads to temporal nonmonotonicity,
i.e., the set of beliefs does not grow
monotonically with time. Default reasoning
leads to logical nonmonotonicity, i.e., the set
of consequences doe... / Additionally the computational complexity of the membership br Nebel Computational Complexity For The Investigation
59 Knowledge Discovery in Databases: An Attribute-Oriented Approach - Han, Cai, Cercone (1992)(Correct)
Knowledge discovery in databases, or data mining,
is an important issue in the development of data- and
knowledge-base systems. An attribute-oriented induction
method has been developed for knowledge ... / substantially reduces the computational complexity of database learning br substantially reduces the computational complexity of the database learning
59 The Trade-offs of Multicast Trees and Algorithms - Wei, Estrin (1995)(Correct)
Multicast trees can be shared across sources (shared trees) or may be source-specific (shortest path
trees). Inspired by recent interests in using shared trees for interdomain multicasting, we investi... / time solutions This computational complexity prohibits on-demand
57 Valued Constraint Satisfaction Problems: Hard and Easy Problems - Schiex (1995)(Correct)
In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, prioriti... / terms of rationality and computational complexity. We exhibit simple br which again shows the computational complexity of strictly monotonic
56 Computational Complexity of Terminological Reasoning in BACK - Nebel (1988)(Correct)
Terminological reasoning is a mode of reasoning all hybrid knowledge
representation systems based on KL-ONE rely on. After a short introduction
of what terminological reasoning amounts to, it is prove... / Computational Complexity of Terminological br the details of analyzing computational complexity of subsumption we show
56 Describing Graphs: a First-Order Approach to Graph Canonization - Immerman, Lander (1990)(Correct)
In this paper we ask the question, "What must be added to first-order logic plus least-fixed point to obtain exactly the polynomial-time properties of unordered graphs?" We consider the languages Lk c... / work on descriptive computational complexity. We will explain this br S one can discuss the computational complexity of checking whether or
56 Temporal Query Languages: a Survey - Chomicki (1995)(Correct)
We define formal notions of temporal domain and temporal database, and use them
to survey a wide spectrum of temporal query languages. We distinguish between an
abstract temporal database and its conc... / query processing and its computational complexity and br negative influence on the computational complexity of query processing. We
56 Wavelet Analysis of Long Range Dependent Traffic - Abry, Veitch (1998)(Correct)
A Wavelet based tool for the analysis of long range dependence is introduced and a related semiparametric
estimator of the Hurst parameter. The estimator is shown to be unbiased under very
general con... / those here due to high computational complexity and memory requirements. br in order to avoid the huge computational complexity of the exact algorithm.
55 Scalable Parallel Data Mining for Association Rules - Han, Karypis, Kumar (1997)(Correct)
One of the important problems in data mining is discovering
association rules from databases of transactions where
each transaction consists of a set of items. The most time
consuming operation in thi... / AS that has smaller computational complexity compared to other
55 Progressive Image Coding on Noisy Channels - Sherwood, Zeger (1997)(Correct)
Numerous sophisticated techniques have been developed over the last several
decades to efficiently transmit images across noisy channels. Here, we cascade
an existing image coder with carefully chosen... / or having extremely high computational complexity. Other techniques br of extremely low computational complexity and great flexibility in
53 Gradient Calculations for Dynamic Recurrent Neural Networks: A Survey - Pearlmutter (1995)(Correct)
We survey learning algorithms for recurrent
neural networks with hidden units, and put the various techniques
into a common framework. We discuss fixedpoint
learning algorithms, namely recurrent backp... / the end address issues of computational complexity and learning speed. br This favorable computational complexity makes it of practical
51 On Syntactic versus Computational Views of Approximability - Khanna, Motwani, Sudan, Vazirani (1994)(Correct)
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational.
Syntactic classes such as MAX SNP permit structural results and have natural complete problems, w... / problems computational complexity computational classes br problems computational complexity computational classes polynomial
48 A Theory Of Program Size Formally Identical To Information Theory - Chaitin (1975)(Correct)
A new definition of program-size complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest self-delimiting program for calculating strings A and B if one is given a minimal-size... / Key Words and Phrases computational complexity entropy information br concepts one derived from computational complexity and the other from
47 A graduated assignment algorithm for graph matching - Gold, Rangarajan (1996)(Correct)
A graduated assignment algorithm for graph matching is presented which is
fast and accurate even in the presence of high noise. By combining graduated
non-convexity (deterministic annealing), two-way ... / achieved. Its low order computational complexity O lm where l and br has a much lower computational complexity O lm or perhaps
46 MONA: Monadic Second-Order Logic in Practice - Henriksen, Jensen, Jørgensen.. (1995)(Correct)
1
The purpose of this article is to introduce Monadic Secondorder
Logic as a practical means of specifying regularity. The logic is a
highly succinct alternative to the use of regular expressions. We... / to common beliefs high computational complexity may be a desired feature br that the lower the computational complexity of a formalism is the
45 Real-Time Internet Video Using Error Resilient Scalable Compression.. - Tan (1999)(Correct)
We introduce a point to point real-time video transmission scheme over the Internet combining a
low-delay TCP-friendly transport protocol in conjunction with a novel compression method that is
error r... / it results in increased computational complexity and delay. Lack of error br of variables and hence computational complexity we restrict all packets
45 Levelwise search and borders of theories in knowledge discovery - Mannila, Toivonen (1997)(Correct)
One of the basic problems in knowledge discovery in databases (KDD) is the following: given a data set r, a class L of sentences for defining subgroups of r, and a selection predicate, find all senten... / We analyze the computational complexity of this algorithm and br relational databases. The computational complexity of the algorithm is
44 Interior Methods for Constrained Optimization - Wright (1992)(Correct)
Interior methods for optimization were widely used in the 1960s, primarily in
the form of barrier methods. However, they were not seriously applied to linear
programming because of the dominance of th... / concentrated on issues of computational complexity in interior methods for br with the theoretical computational complexity of the simplex method.
44 A Survey on Complexity Results for Non-monotonic Logics - Cadoli, Schaerf (1993)(Correct)
This paper surveys the main results appeared in the literature on the computational
complexity of non-monotonic inference tasks. We not only give results
about the tractability/intractability of the i... / in the literature on the computational complexity of non-monotonic
44 On the Computational Complexity of Upward and Rectilinear Planarity.. - Garg, Tamassia (1994)(Correct)
A directed graph is said to be upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in the vertical direction, and no two edges cross. An undirected g... / On the Computational Complexity of Upward and br planar graph algorithm computational complexity NPcomplete problem
43 Descriptive and Computational Complexity - Immerman (1989)(Correct)
Introduction
Computational complexity began with the natural physical notions of time
and space. Given a property, S, an important issue is the computational
complexity of checking whether or not an ... / Descriptive and Computational Complexity Neil Immerman y br Introduction Computational complexity began with the natural
43 The Quantitative Structure of Exponential Time - Lutz (1993)(Correct)
Recent results on the internal, measure-theoretic structure of the exponential time complexity classes E and EXP are surveyed. The measure structure of these classes is seen to interact in informative... / properties of interest in computational complexity. Such interactions br have uniform criteria for computational complexity we consider all such
41 Data Mining - The Search for Knowledge in Databases - Holsheimer, Siebes (1991)(Correct)
Data mining is the search for relationships and global patterns that exist in large databases, but are `hidden'
among the vast amounts of data, such as a relationship between patient data and their me... / Expressive power versus computational complexity br Expressive power versus computational complexity Using a powerful
41 On The Computational Complexity Of Approximating Distributions By.. - Abe, Warmuth (1990)(Correct)
We introduce a rigorous performance criterion for training algorithms for probabilistic automata (PAs) and hidden Markov models (HMMs), used extensively for speech recognition, and analyze the complex... / z jzji . Computational Complexity of Training Probabilistic br trainable. Computational Complexity of Training Probabilistic
41 Natural Proofs - Razborov, Rudich (1994)(Correct)
We introduce the notion of natural proof. We argue that the known
proofs of lower bounds on the complexity of explicit Boolean functions in nonmonotone
models fall within our definition of natural. ... / Electronic Colloquium on Computational Complexity ECCC Technical
40 Automated Analysis of Concurrent Systems with the Constrained.. - Avrunin, Buy, Corbett, Dillon, al. (1991)(Correct)
The constrained expression approach to analysis of concurrent software
systems has several attractive features, including the facts that it
can be used with a variety of design and programming languag... / example measures of the computational complexity of an analysis technique br from known results on the computational complexity of the algorithms it
39 Temporal Deductive Databases - Baudinet, Chomicki, Wolper (1992)(Correct)
We survey a number of approaches to the problem of finite representation of infinite temporal extensions.
Two of them, Datalog 1S and Templog, are syntactical extensions of Datalog ; the third is base... / expressiveness computational complexity. CR Classification br expressiveness and the computational complexity of these languages. We
39 On the Hardness of Approximate Reasoning - Roth (1996)(Correct)
Many AI problems, when formalized, reduce to evaluating the probability that a propositional expression is true. In this paper we show that this problem is computationally intractable even in surprisi... / We analyze the computational complexity of counting satisfying br material from the computational complexity of counting problems
38 Movable Separability of Sets - Toussaint (1985)(Correct)
Spurred by developments in spatial planning in robotics, computer graphics, and VLSI layout, considerable attention has been devoted recently to the problem of moving sets of objects, such as line seg... / surfaces algorithms complexity computational geometry spatial
37 Improved low-degree testing and its applications - Arora, Sudan (1997)(Correct)
NP = PCP(log n; 1) and related results crucially depend upon the close connection
between the probability with which a function passes a low degree test and the distance
of this function to the neares... / Electronic Colloquium on Computational Complexity Reports Series - br interactive protocols. Computational Complexity - .
37 On the Decidability of Query Containment under Constraints - Calvanese, De Giacomo, Lenzerini (1998)(Correct)
Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Rec... / and analyze its computational complexity. We do the same for the br and analyze its computational complexity. . We do the same for
37 Probabilistic Propositional Planning: Representations and Complexity - Littman (1997)(Correct)
Many representations for probabilistic propositional
planning problems have been studied. This paper reviews
several such representations and shows that, in
spite of superficial differences between th... / The paper proves that the computational complexity of determining whether a br of representation in and computational complexity of deterministic
36 A Unifying Framework for Structure and Motion Recovery From Image.. - McLauchlan, Murray (1995)(Correct)
This paper proposes a statistical framework that enables
3D structure and motion to be computed optimally
from an image sequence, on the assumption that feature
measurement errors are independent and ... / the state update has lower computational complexity than the more direct br on a Sparc- . The computational complexity is the same in all three
35 The Complexity of Existential Quantification in Concept Languages - Donini, Hollunder, Lenzerini.. (1992)(Correct)
this paper is that subsumption and unsatisfiability in ALE are
NP-hard. In fact, subsumption is shown to be NP-hard for the simpler language FLE unknown The Complexity of Existential Quantification in... / the study of its computational complexity in several concept br disjunction a source of computational complexity in concept languages.
35 Face Recognition: A Convolutional Neural Network Approach - Lawrence, Giles, Tsoi, Back (1997)(Correct)
Faces represent complex, multidimensional, meaningful visual stimuli and developing a computational model for face recognition is difficult [43]. We present a hybrid neural network solution which comp... / facial details. We analyze computational complexity and discuss how new br in sections and . Computational complexity is considered in section
34 On the Construction of Pseudo-Random Permutations: Luby-Rackoff.. - Naor, Reingold (1997)(Correct)
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from
a pseudo-random function. The method is based on composing four (or three for weakened security)
so called Feist... / Electronic Colloquium on Computational Complexity Reports Series - br an improvement in the computational complexity of the pseudo-random
33 Building Classifiers using Bayesian Networks - Friedman (1996)(Correct)
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with state of the... / the robustness and computational complexity the search process is br among attributes and the computational complexity in the learning stage.
33 A Simple and Fast Incremental Randomized Algorithm for Computing.. - Seidel (1991)(Correct)
This paper presents a very simple incremental randomized algorithm for
computing the trapezoidal decomposition induced by a set S of n line segments
in the plane. If S is given as a simple polygonal c... / and finally the actual computational complexity of the problem remained br about the intrinsic computational complexity of triangulating once and
33 Efficient Multiscale Regularization with Applications to the.. - Luettgen, Karl, Willsky (1993)(Correct)
A new approach to regularization methods for image processing is introduced and
developed using as a vehicle the problem of computing dense optical flow fields in an
image sequence. Standard formulati... / in fact has a per pixel computational complexity which is independent of br method is employed computational complexity per pixel typically
32 Surface Approximation and Geometric Partitions - Agarwal, Suri (1994)(Correct)
Motivated by applications in computer graphics, visualization, and scientific computation, we study the computational complexity of the following problem: Given a set S of n points sampled from a biva... / computation we study the computational complexity of the following problem
32 STING : A Statistical Information Grid Approach to Spatial Data Mining - Wang (1997)(Correct)
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of spatial data and to th... / Consequently the computational complexity is at least linearly br hierarchy. Moreover the computational complexity is O NlogN
32 Towards an Effective Calculus for Object Query Languages - Fegaras, Maier (1995)(Correct)
We define a standard of effectiveness for a database calculus
relative to a query language. Effectiveness judges suitability
to serve as a processing framework for the query language,
and comprises as... / used to study issues of computational complexity and relative expressive
31 Discretized Marching Cubes - Montani, Scateni, Scopigno (1994)(Correct)
Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. This p... / increasing the overall computational complexity. The algorithm assumes br segment. The worst case computational complexity of the merging phase is
31 Efficient Approximations for the Marginal Likelihood of Bayesian.. - Chickering, Heckerman (1996)(Correct)
We discuss Bayesian methods for model averaging and model selection among Bayesiannetwork
models with hidden variables. In particular, we examine large-sample approximations
for the marginal likelihoo... / methods it has a computational complexity of O d N br for our experiments. . Computational Complexity The accuracy of these
30 Finding Hard Instances of the Satisfiability Problem: A Survey - Cook, Mitchell (1997)(Correct)
Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we conside... / position in the study of computational complexity. As the dual of br H. Papadimitriou. Computational Complexity. Addison-Wesley .
30 The Parallel Multipole Method on the Connection Machine - Zhao, Johnsson (1991)(Correct)
This paper reports on a fast implementation of the three-dimensional nonadaptive Parallel Multipole Method (PMM) on the Connection Machine system model CM--2. The data interactions within the decompos... / To minimize the computational complexity the decomposition of a br instead yields a lower computational complexity. Subdomains that are not
30 Solving Polynomial Systems Using a Branch and Prune Approach - Van Hentenryck, McAllester, Kapur (1997)(Correct)
This paper presents Newton, a branch & prune algorithm to find all isolated solutions of a system of polynomial constraints. Newton can be characterized as a global search method which uses intervals ... / due to its inherent computational complexity i.e.it is NP-hard and br between pruning and computational complexity. In this section we
29 Tractable Reasoning via Approximation - Schaerf, Cadoli (1995)(Correct)
Problems in logic are well-known to be hard to solve in the worst case. Two
different strategies for dealing with this aspect are known from the literature:
language restriction and theory approximati... / to perform have high computational complexity. Problems in logic are br AI typically have higher computational complexity than classical -
29 Number-Theoretic Constructions of Efficient Pseudo-Random Functions - Naor, Reingold (1997)(Correct)
We describe efficient constructions for various cryptographic primitives (both in privatekey
and in public-key cryptography). We show these constructions to be at least as secure as
the decisional ver... / . Has applications to computational complexity i.e.Natural Proofs br Electronic Colloquium on Computational Complexity O. Goldreich S.
29 Constructing Conditional Plans by a Theorem-Prover - Rintanen (1999)(Correct)
The research on conditional planning rejects the assumptions that there is no uncertainty
or incompleteness of knowledge with respect to the state and changes of the system the
plans operate on. Witho... / discuss the results on the computational complexity of conditional planning br formulae in the theory of computational complexity stems from the fact that
29 Wavelet Packet Image Coding Using Space-frequency Quantization - Xiong, Ramchandran, Orchard (1998)(Correct)
We extend our previous work on space-frequency quantization (SFQ) [1] for image coding from wavelet transforms to the more general wavelet packet transforms [2]. The resulting wavelet packet coder off... / lowering the computational complexity over that of an br practical coder design computational complexity must be taken into
29 The Comparative Linguistics of Knowledge Representation - Gogic, Kautz (1995)(Correct)
We develop a methodology for comparing knowledge representation formalisms in terms of their "representational succinctness," that is, their ability to express knowledge situations relatively efficien... / is just a disguise of computational complexity of inference criterion br C.H. Papadimitriou. Computational complexity. Addison Wesley .
29 Fast Isocontouring For Improved Interactivity - Chandrajit Bajaj (1996)(Correct)
We present an isocontouringalgorithm which is near-optimal
for real-time interaction and modification of isovalues in large
datasets. A preprocessing step selects a subset S of the
cells which are con... / propagation algorithm. The computational complexity for the repeated action
28 An Overview of Nonmonotonic Reasoning and Logic Programming - Minker (1993)(Correct)
The focus of this paper is nonmonotonic reasoning as it relates to logic programming. I discuss the pre-history of nonmonotonic reasoning starting from approximately 1958. I then review the research t... / logic programming and computational complexity. It is of interest to br logic programming and computational complexity are unique contributions
28 Context-Based Vision: Recognizing Objects Using Information From Both .. - Strat, Fischler (1991)(Correct)
This paper describes results from an ongoing project concerned with recognizing objects
in complex scene domains, and especially in the domain that includes the natural
outdoor world. Traditional mach... / a major increase in computational complexity. Contexts are much more br time To compute the computational complexity of the Condor
28 The Quadratic Assignment Problem: A Survey and Recent Developments - Pardalos, Rendl, Wolkowicz (1994)(Correct)
Quadratic Assignment Problems model many applications in
diverse areas such as operations research, parallel and distributed computing,
and combinatorial data analysis. In this paper we survey some ... / generalizations. The computational complexity is described in Section br are discussed. Although computational complexity characterizes worst case
27 On the Complexity of Solving Markov Decision Problems - Littman, Dean, Kaelbling (1995)(Correct)
Markov decision problems (MDPs) provide
the foundations for a number of problems
of interest to AI researchers studying automated
planning and reinforcement learning.
In this paper, we summarize resul... / worth knowing about the computational complexity of solving MDPs. br analyzed the computational complexity of MDPs. They showed
27 Stage Scheduling: A Technique to Reduce the Register Requirements of.. - Eichenberger, Davidson (1995)(Correct)
Modulo scheduling is an efficient technique for
exploiting instruction level parallelism in a variety
of loops, resulting in high performance code but
increased register requirements. We present a set... / We present a set of low computational complexity stage-scheduling br with linear or quadratic computational complexity that find a schedule
27 Finding faces in cluttered scenes using random labeled graph matching - Leung, Burl, Perona (1995)(Correct)
An algorithm for locating quasi-frontal views of human faces in cluttered scenes is presented. The algorithm works by coupling a set of local feature detectors with a statistical model of the mutual d... / in order to reduce the computational complexity also potential matches br exploited to contain the computational complexity at a reasonable level.
27 The Dynamic Window Approach to Collision Avoidance - Fox, Burgard, Thrun (1997)(Correct)
This paper describes the dynamic window approach to reactive collision avoidance
for mobile robots equipped with synchro-drives. The approach is derived directly
from the motion dynamics of the robot ... / ones lies in their low computational complexity which is particularly
27 Oracle Quantum Computing - Berthiaume, Brassard (1994)(Correct)
Building on work of Deutsch and Jozsa, we construct oracles relative to which
(1) there is a decision problem that can be solved with certainty in worst-case polynomial
time on the quantum computer, y... / classical computers from a computational complexity point of view br computer science and computational complexity theory pioneered by
27 Computational Properties of Qualitative Spatial Reasoning: First.. - Nebel (1995)(Correct)
While the computational properties of qualitative temporal
reasoning have been analyzed quite thoroughly, the computational properties
of qualitative spatial reasoning are not very well investigated... / spatial calculi and no computational complexity analysis has been carried br completeness or computational complexity of the proposed calculi.
27 Computing Near-Optimal Solutions to Combinatorial Optimization.. - Shmoys (1995)(Correct)
In the past few years, there has been significant progress in our
understanding of the extent to which near-optimal solutions can be efficiently
computed for NP-hard combinatorial optimization probl... / threads of research in computational complexity theory has been to give br interactive protocols. Computational complexity - . . M.
26 Verification of a Multiplier: 64 Bits and Beyond - Kurshan, Lamport (1993)(Correct)
Verifying a 64-bit multiplier has a computational complexity
that puts it beyond the grasp of current finite-state algorithms, including
those based upon homomorphic reduction, the induction princip... / a -bit multiplier has a computational complexity that puts it beyond the br intervention. However computational complexity limits the applicability
26 Theory and Algorithms for Plan Merging - Foulser, Li, Yang (1992)(Correct)
Merging operators in a plan can yield significant savings in the cost to execute a
plan. This paper provides a formal theory for plan merging and presents both optimal
and efficient heuristic algorith... / be merged . What is the computational complexity of optimal plan mering br in. We now consider the computational complexity as a result of the third
26 Person Counting With Stereo - Beymer (2000)(Correct)
For the problem of tracking vehicles on freeways using machine
vision, existing systems work well in free-flowing
traffic. Traffic engineers, however, are more interested in
monitoring freeways when t... / representation is reduced computational complexity. However the inability
25 Randomized Kinodynamic Planning - LaValle, Kuffner, Jr. (1999)(Correct)
This paper presents a state-space perspective on the kinodynamic planning problem, and introduces a randomized path planning technique that computes collision-free kinodynamic trajectories for high de... / stopping path The computational complexity of kinodynamic planning
25 Expressibility And Parallel Complexity - Immerman (1989)(Correct)
It is shown that the time needed by a concurrent-read, concurrentwrite
parallel random access machine (CRAM) to check if an input
has a certain property is the same as the minimal depth of a firstorde... / time. Key words. Computational complexity parallel complexity br Descriptive and computational complexity Proc. AMS Short
25 An Algorithm to Evaluate Quantified Boolean Formulae - Cadoli, Giovanardi, Schaerf (1998)(Correct)
The high computational complexity of advanced reasoning
tasks such as belief revision and planning calls
for efficient and reliable algorithms for reasoning problems
harder than NP. In this paper we p... / Abstract The high computational complexity of advanced reasoning br STRIPS-like planning have computational complexity higher that the
25 Networks of Spiking Neurons: The Third Generation of Neural Network.. - Maass (1996)(Correct)
The computational power of formal models for networks of spiking neurons
is compared with that of other neural network models based on McCulloch
Pitts neurons (i.e. threshold gates) respectively sigmo... / Electronic Colloquium on Computational Complexity Reports Series - br W. Maass On the computational complexity of networks of spiking
25 On Reliable Surface Reconstruction from Multiple Range Images - Hilton (1996)(Correct)
This paper addresses the problem of integrating multiple registered 2.5D range images into
a single 3D surface model which has topology and geometry consistent with the measurements.
Reconstruction of... / previously undocumented. Computational complexity and limitations are br issues. Firstly the computational complexity of each of the
25 Speeding Up Isosurface Extraction using Interval Trees - Cignoni, Marino, Montani, Puppo.. (1997)(Correct)
The interval tree is an optimally efficient search structure proposed by Edelsbrunner [5] to retrieve
intervals of the real line that contain a given query value. We propose the application of such a ... / disregarding the computational complexity this can be highly br However a worst case computational complexity of O n has been
24 Constraint Satisfaction: The Approximability of Minimization Problems - Khanna, Sudan, Trevisan (1997)(Correct)
This paper continues the work initiated by Creignou [Cre95] and Khanna, Sudan and
Williamson [KSW96] who classify maximization problems derived from boolean constraint satisfaction.
Here we study the ... / Electronic Colloquium on Computational Complexity . Preliminary br Electronic Colloquium on Computational Complexity . KSW S.
24 Practical Protocols For Certified Electronic Mail - Deng, Gong, Lazar, Wang (1996)(Correct)
Electronic mail, or e-mail, has brought us a big step closer towards the vision of paperless
offices. To advance even closer to this vision, however, it is essential that existing e-mail systems
be... / definition based on equal computational complexity makes sense Page
24 The Use of Context in Large Vocabulary Speech Recognition - Odell (1995)(Correct)
decide which contexts are similar and can share parameters. A key feature of
this approach is that it allows the construction of models which are dependent upon contextual
effects occurring across wo... / performance in terms of computational complexity and recognition accuracy. br Tables . Variation in computational complexity with pruning.
23 Error-Based and Entropy-Based Discretization of Continuous Features - Kohavi, Sahami (1996)(Correct)
We present a comparison of error-based and entropybased
methods for discretization of continuous features.
Our study includes both an extensive empirical
comparison as well as an analysis of scenarios... / and analyze the computational complexity of each method. Our br We also present the computational complexity of each discretization
23 Likelihood Calculation for a Class of Multiscale Stochastic Models.. - Luettgen, Willsky (1995)(Correct)
A class of multiscale stochastic models based on scale-recursive dynamics on trees has recently
been introduced. Theoretical and experimental results have shown that these models provide
an extremely ... / has a constant per-pixel computational complexity. We illustrate one br appendix we analyze the computational complexity of the likelihood
23 The Expressiveness of a Family of Finite Set Languages - Immerman (1991)(Correct)
In this paper we characterise exactly the complexity of a set based database
language called SRL, which presents a unified framework for queries and updates.
By imposing simple syntactic restrictions ... / from those due to its computational complexity. Our motivation includes br study of descriptive and computational complexity IL Another of us
23 Multiple Description Wavelet Based Image Coding - Sergio Servetto (1998)(Correct)
We consider the problem of coding images for transmission over error-prone channels. The impairments
we target are transient channel shutdowns, as would occur in a packet network when a packet is
lost... / coders b its computational complexity is very low it
23 Generalized Guaranteed Rate Scheduling Algorithms: A Framework - Goyal, Vin(Correct)
In this paper, we define a class of generalized Guaranteed
Rate (GR) scheduling algorithms that includes algorithms
which allocate variable rate to packets of a flow. We
define work conserving general... / for such servers reduce computational complexity as well as delay
23 Simulated Annealing for Hard Satisfiability Problems - Spears (1993)(Correct)
Satisfiability (SAT) refers to the task of finding a truth assignment that makes an
arbitrary boolean expression true. This paper compares a simulated annealing algorithm
(SASAT) with GSAT (Selman et ... / operations research and computational complexity communities. Due to the
22 Coalitions among Computationally Bounded Agents - Sandholm, Lesser(Correct)
This paper analyzes coalitions among self-interested agents that need to solve combinatorial optimization problems to operate efficiently in the world. By colluding (coordinating their actions by solv... / rationality is bounded by computational complexity. Abbreviated br targeted to reduce the computational complexity in the number of
22 A Domain Theory for Task Oriented Negotiation - Zlotkin(Correct)
We present a general theory that captures the
relationship between certain domains and negotiation
mechanisms. The analysis makes it
possible to categorize precisely the kinds of domains
in which agen... / as well as relatively low computational complexity. Our overall goal is to
22 A Complete Classification of the Approximability of Maximization.. - Khanna, Sudan, Williamson (1997)(Correct)
In this paper we study the approximability of boolean constraint satisfaction problems. A
problem in this class consists of some collection of "constraints" (i.e., functions f : f0; 1g
k
!
f0; 1g); ... / complete problems computational complexity computational classes br Electonic Colloquium on Computational Complexity Technical report no.
22 Scheduling as a fuzzy multiple criteria optimization problem - Slany (1996)(Correct)
Real-world scheduling is decision making under vague constraints of different importance, often using uncertain data, where compromises between antagonistic criteria are allowed. The author explains i... / of problems with high computational complexity solving for example the
22 Kinodynamic Motion Planning - Donald (1993)(Correct)
Kinodynamic planning attempts to solve a robot motion problem subject to simultaneous
kinematic and dynamics constraints. In the general problem, given a robot system,
we must find a minimal-time t... / trade off planning time computational complexity against optimality in
22 Novel cluster-based probability model for texture synthesis.. - Popat (1993)(Correct)
We present a new probabilistic modeling technique for high-dimensional vector sources, and consider its application to the problems of texture synthesis, classification, and compression. Our model com... / both the accuracy and computational complexity of the model. Let
22 Optimal Multicast Feedback - Nonnenmacher, Biersack (1998)(Correct)
We investigate the scalability of feedback in multicast communication and propose a new method of probabilistic feedback based on exponentially distributed timers. By analysis and simulation for up to... / little state and has a low computational complexity at every receiver -
22 Simplified Support Vector Decision Rules - Burges (1996)(Correct)
A Support Vector Machine (SVM) is a universal
learning machine whose decision surface
is parameterized by a set of support vectors,
and by a set of corresponding weights.
An SVM is also characterized ... / method can decrease the computational complexity of the decision rule by
21 Stationary Default Extensions - Przymusinska, Prymusinski (1992)(Correct)
this paper we introduce the class of so called stationary extensions of a default theory.
Stationary extensions include, as a special case, Reiter's original default extensions but allow
us to elimina... / coincides with the computational complexity of satisfiability tests
21 State-Space Abstraction for Anytime Evaluation of Probabilistic.. - Wellman, Liu (1994)(Correct)
ion for Anytime Evaluation of Probabilistic Networks Michael P. Wellman and Chao-Lin Liu University of Michigan Artificial Intelligence Laboratory 1101 Beal Avenue Ann Arbor, MI 48109-2110 USA {wellma... / factor determining the computational complexity of evaluating a br Cooper G. F. The computational complexity of probabilistic
21 Long Short-Term Memory - Hochreiter, Schmidhuber (1997)(Correct)
Learning to store information over extended time intervals via recurrent backpropagation takes a very long time, mostly due to insufficient, decaying error back flow. We briefly review Hochreiter's 19... / in space and time its computational complexity per time step and weight br efficient see paragraph computational complexity A memory cell block
21 On the Computational Complexity of Temporal Projection, Planning, and .. - Nebel, Bäckström (1994)(Correct)
One kind of temporal reasoning is temporal projection---the computation
of the consequences of a set of events. This problem is related
to a number of other temporal reasoning tasks such as plan valid... / pp. - On the Computational Complexity of Temporal Projection br They investigate the computational complexity of a number of
21 Noise Reduction Using an Undecimated Discrete Wavelet Transform - Lang, Guo, Odegard, Burrus (1996)(Correct)
A new nonlinear noise reduction method is presented that uses the discrete wavelet transform. Similar to Donoho and Johnstone, we employ thresholding in the wavelet transform domain but, following a s... / have to be stored and the computational complexity is O N The br N log N values and has computational complexity O N log N
21 Instance Complexity - Orponen, Ko, Schöning, Watanabe (1994)(Correct)
We introduce a measure for the computational complexity of individual instances of a
decision problem and study some of its properties. The instance complexity of a string
x with respect to a set A a... / a measure for the computational complexity of individual instances
21 On the Computational Complexity of Temporal Projection and Plan.. - Nebel, Bäckström (1992)(Correct)
One kind of temporal reasoning is temporal
projection---the computation of the consequences
of a set of events. This problem is related to a
number of other temporal reasoning tasks such
as story unde... / On the Computational Complexity of Temporal Projection br They investigate the computational complexity of a number of restricted
21 Extracting all the Randomness and Reducing the Error in Trevisan's.. - Raz, Reingold, Vadhan (1999)(Correct)
We give explicit constructions of extractors which work for a source of any min-entropy on strings of length n. The first construction extracts any constant fraction of the min-entropy using O(log 2 n... / Electronic Colloquium on Computational Complexity Technical Report br Annual IEEE Conference on Computational Complexity pages -
21 Error Protection for Progressive Image Transmission over Memoryless.. - Sherwood, Zeger (1998)(Correct)
A product channel code is proposed to protect progressively
compressed and packetized image data that
is transmitted across noisy channels. Across packets,
the product code is composed of Reed-Solomon... / the algorithm can reduce computational complexity by only searching for br to correct erasures the computational complexity is reduced and twice as
21 Vector Quantization with Complexity Costs - Buhmann, Kühnel (1993)(Correct)
Vector quantization is a data compression method where a set of data points is encoded by a reduced set of reference vectors, the codebook. We discuss a vector quantization strategy which jointly opti... / common for many Computational complexity issues like the br Thereby the computational complexity would be drastically
20 Local Search and the Number of Solutions - Clark, Frank, Gent, MacIntyre.. (1996)(Correct)
There has been considerable research interest into the solubility phase transition,
and its effect on search cost for backtracking algorithms. In this paper we
show that a similar easy-hard-easy patte... / transition. Keywords computational complexity constraint satisfaction
20 Direct Least Squares Fitting of Ellipses - Fitzgibbon, Pilu, Fisher (1996)(Correct)
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distan... / great shortcomings of high computational complexity and non-uniqueness of
20 How Bad is Naive Multicast Routing? - Doar, Leslie (1993)(Correct)
When the problem of routing multicast connections
in networks has been previously considered, the aim
has been to minimise overall costs, possibly subject
to a delay constraint. The emphasis has been ... / by two properties their computational complexity and their br tree. The worst case computational complexity of the KMB algorithm is
20 Pseudorandom generators without the XOR Lemma - Sudan, Trevisan, Vadhan (1998)(Correct)
Impagliazzo and Wigderson [IW97] have recently shown that if there exists a decision problem solvable
in time 2
O(n)
and having circuit complexity 2 \Omega\Gamma
n)
(for all but finitely many n) t... / has publishable proofs. Computational Complexity - . br of random matrices. Computational Complexity - .
20 Linearity Testing in Characteristic Two - Bellare, Coppersmith, Håstad.. (1995)(Correct)
Let Dist(f; g) = Pr u [ f(u)
6=g(u)
] denote the relative distance between functions f; g mapping
from a group G to a group H , and let Dist(f) denote the minimum, over all linear
functions (... / of the contributions of computational complexity theory has been to br interactive protocols. Computational Complexity Vol. - .
20 A Domain-Independent Algorithm for Plan Adaptation - Hanks (1995)(Correct)
The paradigms of transformational planning, case-based planning, and plan debugging
all involve a process known as plan adaptation --- modifying or repairing an old plan so
it solves a new problem. In... / performance. Second computational complexity arguments show that
20 Reasoning in Expressive Description Logics - Calvanese (1998)(Correct)
this paper, which correspond to a language called ALCQI reg . For a comprehensive
description of the constructs used in DLs, see [Woods and Schmolze 1992,
De Giacomo 1995, Calvanese 1996c, Donini et a... / like language and the computational complexity of reasoning was br most of the results on the computational complexity of DLs have been devised
20 On the Feasibility of Checking Temporal Integrity Constraints - Chomicki, Niwinski (1995)(Correct)
We analyze the computational feasibility of checking temporal integrity constraints formulated in
some sublanguages of first-order temporal logic. Our results illustrate the impact of the quantifier
p... / logic decidability computational complexity temporal databases. br be considered and their computational complexity analyzed. An important
20 Time-lock puzzles and timed-release Crypto - Rivest, Shamir, Wagner (1996)(Correct)
Introduction Our motivation is the notion of "timed-release crypto," where the goal is to encrypt a message so that it can not be decrypted by anyone, not even the sender, until a pre-determined amoun... / an approach based on computational complexity we study the problem of
20 On Growing Context-Sensitive Languages - Buntrock, Lorys (1992)(Correct)
Growing context-sensitive grammars (GCSG) are investigated. The variable
membership problem for GCSG is shown to be NP-complete. This solves a problem
posed in [DW86]. It is also shown that the langua... / formal language theory and computational complexity theory and use the
19 Probabilistic Object Recognition using Multidimensional Receptive.. - Schiele (1996)(Correct)
This paper describes a probabilistic object recognition
technique which does not require correspondence matching
of images. This technique is an extension of our earlier work
on object recognition usi... / computationalcost and a computational complexity which is linear with the
19 The Computational Complexity of Cartographic Label Placement - Marks, Shieber (1991)(Correct)
We examine the computational complexity of cartographic label placement, a problem derived from the cartographer's task of placing text labels adjacent to map features in such a way as to minimize ove... / The Computational Complexity of Cartographic Label br Abstract We examine the computational complexity of cartographic label
19 Relating Equivalence And Reducibility To Sparse Sets - Allender, Hemachandra, Ogiwara, al. (1992)(Correct)
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a
sparse set is a broader notion than being r-equivalent to a sparse set. Although distinguishing equivalen... / to recent advances in computational complexity theory see also br for hosting a workshop on computational complexity in August at
19 Polynomial Time Query Processing in Temporal Deductive Databases - Chomicki (1990)(Correct)
We study conditions guaranteeing polynomial time computability
of queries in temporal deductive databases. We
show that if for a given set of temporal rules, the period
of its least models is bounded ... / However due to computational complexity considerations TDDs are br terms. . Computational complexity The graph Gr Z Q
19 Performance Estimation of Embedded Software with Instruction Cache.. - Li, Malik, Wolfe (1995)(Correct)
Embedded systems generally interact with the outside world. Thus, some real-time constraints may be imposed on the system design. Verification of these constraints requires computing a tight upper bou... / prediction accuracy for computational complexity by proposing different br above methods encounter computational complexity because they try to
19 A Multi-Resolution Relational Data Model - Robert Read (1992)(Correct)
The use of data at different levels of information content
is essential to the performance of multimedia,
scientific, and other large databases because it can
significantly decrease I/O and communicat... / the implementation and computational complexity of sandbag operations in
19 Ellipsis and Quantification: A Substitutional Approach - Crouch (1995)(Correct)
The paper describes a substitutional approach
to ellipsis resolution giving comparable
results to (?), but without the
need for order-sensitive interleaving of
quantifier scoping and ellipsis resoluti... / This increases the computational complexity of the ellipsis
19 Deadline Monotonic Scheduling - Neil Audsley (1990)(Correct)
This paper investigates schedulability tests for mixtures of periodic and
aperiodic processes. Following an introduction outlining the constraints
associated with rate-monotonic scheduling new schedul... / between accuracy and computational complexity for these schedulability br is that the former is of computational complexity O n
19 Finite Representation of Infinite Query Answers - Chomicki, Imielinski (1992)(Correct)
We define here a formal notion of finite representation of infinite query answers in
logic programs. We apply this notion to Datalog nS (Datalog with n successors): an extension of
Datalog capable ... / decidability safety computational complexity non-standard query br In Section we discuss computational complexity issues. In Section we
18 Search-Intensive Concept Induction - Giordana (1995)(Correct)
This paper describes REGAL, a distributed genetic algorithm-based system, designed
for learning First Order Logic concept descriptions from examples. The system is a
hybrid between Pittsburgh's and Mi... / real-world concepts is computational complexity. As Mitchell br A second reason is computational complexity the shared fitness
18 The Effect of Multiple Time Scales and Subexponentiality in MPEG.. - Jelenkovic, Lazar, Semret (1997)(Correct)
Guided by the empirical observation that realtime
MPEG video streams exhibit both multiple time scale
and subexponential characteristics, we construct a video
model that captures both of these charact... / suffer from high computational complexity. Landry and Stavrakakis br of almost negligable computational complexity unlike the case of
18 Complexity Limitations on Quantum Computation - Fortnow, Rogers (1997)(Correct)
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum ... / two powerful tools from computational complexity theory to bear on this br polynomial hierarchy. Computational Complexity - .
18 Recognition by Prototypes - Basri (1993)(Correct)
A scheme for recognizing 3D objects from single 2D images under orthographic projection
is introduced. The scheme proceeds in two stages. In the first stage, the categorization
stage, the image is com... / methods for reducing the computational complexity of the recognition br a way to reduce this computational complexity. The objective of