Search results for "computational complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Thomas Jansen, Frank Neumann	Computational complexity and evolutionary computation.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	computational complexity, evolutionary computation
3	Suksan Jirachaweng, Teesid Leelasawassuk, Vutipong Areekul	Performance and Computational Complexity Comparison of Block-Based Fingerprint Enhancement.	ICB	2009	DBLP DOI BibTeX RDF	Fingerprint Enhancement, Fingerprint Enhancement Performance Comparison, Spatial-Domain/Frequency-Domain Fingerprint Enhancement, Fingerprint Enhancement Computational Complexity
3	Thomas Jansen, Frank Neumann	Computational complexity and evolutionary computation.	GECCO (Companion)	2008	DBLP DOI BibTeX RDF	computational complexity, evolutionary computation
3	Syed Sajjad Rizvi, Aasia Riasat, Khaled M. Elleithy	Transformation Matrix System for Reducing the Computational Complexity of Wireless Multi-User Receivers for DS-CDMA Systems.	ITNG	2008	DBLP DOI BibTeX RDF	Multiuser Communications, Computational Complexity, DS-CDMA, Transformation Matrix
3	Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao	Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	multi-prover interactive proof systems, quantum nonlocality, Tsirelson inequality, entanglement
3	Haining Fan, M. Anwar Hasan	Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	subquadratic computational complexity multiplication, Finite field, normal basis, optimal normal basis
3	Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette	Comparing Genomes with Duplications: A Computational Complexity Point of View.	IEEE/ACM Trans. Comput. Biology Bioinform.	2007	DBLP DOI BibTeX RDF	maximum adjacency disruption number, summed adjacency disruption number, computational complexity, Comparative genomics, common intervals
3	Thomas Jansen, Frank Neumann	Computational complexity and evolutionary computation.	GECCO (Companion)	2007	DBLP DOI BibTeX RDF	computational complexity, evolutionary computation, theory
3	Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf	07411 Abstracts Collection -- Algebraic Methods in Computational Complexity.	Algebraic Methods in Computational Complexity	2007	DBLP BibTeX RDF
3	Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf	07411 Executive Summary -- Algebraic Methods in Computational Complexity.	Algebraic Methods in Computational Complexity	2007	DBLP BibTeX RDF
3	Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilkerson	Measuring empirical computational complexity.	ESEC/SIGSOFT FSE	2007	DBLP DOI BibTeX RDF	empirical computational complexity, trend-prof
3	Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf	On Computation and Communication with Small Bias.	IEEE Conference on Computational Complexity	2007	DBLP DOI BibTeX RDF
3	Manolis Koubarakis, Spiros Skiadopoulos, Christos Tryfonopoulos	Logic and Computational Complexity for Boolean Information Retrieval.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	Boolean information retrieval, computational complexity, query languages, data models, satisfiability, proximity, entailment
3	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart	The Computational Complexity of the Parallel Knock-Out Problem.	LATIN	2006	DBLP DOI BibTeX RDF	Parallel knock-out, computational complexity, graphs
3	Pavel Pudlák	Godel and Computations (Abstract).	IEEE Conference on Computational Complexity	2006	DBLP DOI BibTeX RDF
3	Jun Xu, Richard J. Lipton	On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	quality of service, computational complexity, decision tree, packet scheduling, delay bound
3	Jin-yi Cai, Hong Zhu	Progress in Computational Complexity Theory.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms
3	Predrag T. Tosic, Gul A. Agha	On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata.	UC	2005	DBLP DOI BibTeX RDF	Cellular and graph automata, sequential and synchronous dynamical systems, configuration space properties, #P-completeness, computational complexity
3	Harry Buhrman, Lance Fortnow, Thomas Thierauf	04421 Abstracts Collection - Algebraic Methods in Computational Complexity.	Algebraic Methods in Computational Complexity	2004	DBLP BibTeX RDF
3	Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia	Tight Lower Bounds for Certain Parameterized NP-Hard Problems.	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
3	Venkatesan Guruswami, Daniele Micciancio, Oded Regev	The Complexity of the Covering Radius Problem on Lattices and Codes.	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
3	Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang	Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
3	Jirí Fiala, Daniël Paulusma	The Computational Complexity of the Role Assignment Problem.	ICALP	2003	DBLP DOI BibTeX RDF	role assignment 2002 Mathematics Subject Classification: 05C15, computational complexity, 03D15, graph homomorphism
3	R. Elijah Blessing, V. Rhymend Uthariaraj	Evaluation and Analysis of Computational Complexity for Secure Multicast Models.	ICCSA	2003	DBLP DOI BibTeX RDF	LeaSel, security, computational complexity, scalability, Multicast, encryptions, key distribution
3	Robert Rettinger, Klaus Weihrauch	The computational complexity of some julia sets.	STOC	2003	DBLP DOI BibTeX RDF	julia sets, computational complexity
3	Arnold Beckmann	A Note on Universal Measures for Weak Implicit Computational Complexity.	LPAR	2002	DBLP DOI BibTeX RDF	Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
3	Dan C. Marinescu, Yongchang Ji, Gabriela M. Marinescu	Genetic Economy, Symmetry, and Computational Complexity for Atomic Virus Structure Determination. (PDF / PS)	IPDPS	2002	DBLP DOI BibTeX RDF	3D atomic structure, parallel orientation, asymmetric particles, computational complexity, electron microscopy
3	Jun Xu, Richard J. Lipton	On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.	SIGCOMM	2002	DBLP DOI BibTeX RDF	quality of service, computational complexity, decision tree, packet scheduling, delay bound
3	Ngoc Binh Nguyen, Tu Bao Ho	A Mixed Similarity Measure in Near-Linear Computational Complexity for Distance-Based Methods.	PKDD	2000	DBLP DOI BibTeX RDF	mixed similarity measure (MSM), distance-based methods, computational complexity, very large databases
3	Gabriel Istrate	Computational Complexity and Phase Transitions. (PDF / PS)	IEEE Conference on Computational Complexity	2000	DBLP DOI BibTeX RDF
3	Emanuele Covino, Giovanni Pani, Salvatore Caporaso	Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.	CIAC	2000	DBLP DOI BibTeX RDF	time-space classes, elementary functions, implicit computational complexity
3	Maria Grazia Albanesi, Alessandro Giancane	Fast Retrieval on Compressed Images for Internet Applications.	CAMP	2000	DBLP DOI BibTeX RDF	compressed images retrieval, content-based retrieval algorithm, digital image transform scheme, modified Wavelet multiresolution decomposition, multiresolution algorithm, index generation, YUV compressed JPEG images, Internet imaging, Internet, performance, computational complexity, computational complexity, feature extraction, indexing, visual data
3	Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura	Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices.	RTCSA	2000	DBLP DOI BibTeX RDF	secondary cells, power generation scheduling, power engineering computing, real time task scheduling algorithms, maximum utilization, secondary batteries, low power energy techniques, dynamic real time scheduling algorithms, secondary battery consumption, CPU frequency, real time scheduling algorithm, discrete frequency control, arbitrary frequency, real-time systems, computational complexity, computational complexity, NP-complete, portable devices, decision problem, portable computers, scheduling problem, task switching, real time tasks, amortized analysis, optimal scheduling algorithm, frequency control, frequency control
3	Liming Cai, Jianer Chen, Johan Håstad	Circuit Bottom Fan-in and Computational Power. (PDF / PS)	IEEE Conference on Computational Complexity	1997	DBLP DOI BibTeX RDF	computational complexity, lower bound, circuit complexity, alternating Turing machine
3	Jian Chen, Valerie E. Taylor	PART: a partitioning tool for efficient use of distributed systems.	ASAP	1997	DBLP DOI BibTeX RDF	partitioning tool, geographically distributed supercomputers interconnection, decomposition tool, finite element based problems, performance, distributed systems, computational complexity, computational complexity, simulated annealing, wide area network, high-speed networks, execution time, processor performance, PART
3	Bozidar Potocnik, Damjan Zazula, Danilo Korze	Automated computer-assisted detection of follicles in ultrasound images of ovary.	CBMS	1997	DBLP DOI BibTeX RDF	automated computer-assisted detection of follicles, ultrasound images of ovary, human reproduction, object recognition scheme, computational complexity, computational complexity, image segmentation, image classification, preprocessing
3	Kwok-Wai Cheung, Lai-Man Po	Preprocessing for Discrete Multiwavelet Transform of Two-Dimensional Signals. (PDF / PS)	ICIP	1997	DBLP DOI BibTeX RDF	discrete multiwavelet transform, two-dimensional signals, tree-structured matrix filter bank, vector sequence input, 2D approximation-based preprocessing scheme, energy compression ability, performance, computational complexity, computational complexity
3	Steven Gold, Anand Rangarajan	Graph matching by graduated assignment.	CVPR	1996	DBLP DOI BibTeX RDF	graduated assignment, graph matching energy function, weighted graph matching, attributed relational graph matching, computational complexity, computational complexity, graph theory, pattern matching, constraint satisfaction, graph matching, subgraph isomorphism, softassign
3	Mahesh Mehendale, Sunil D. Sherlekar, G. Venkatesh	Low power realization of FIR filters using multirate architectures.	VLSI Design	1996	DBLP DOI BibTeX RDF	low power realization, multirate architectures, computationally efficient implementations, power dissipation reduction, dedicated ASIC implementation, TMS320C2x/C5x programmable DSP, computational complexity, computational complexity, application specific integrated circuits, power analysis, digital filters, FIR filters, FIR filters, digital signal processing chips
3	Ireneusz Karkowski	Architectural synthesis with possibilistic programming.	HICSS	1995	DBLP DOI BibTeX RDF	possibilistic programming, fuzzy mathematical programming, simultaneous scheduling, FOAS, computational complexity, computational complexity, fuzzy logic, high level synthesis, high-level synthesis, circuit CAD, mathematical programming, possibility theory
3	Jean-Marc Laferté, Fabrice Heitz, Patrick Pérez, Eric Fabre	Hierarchical Statistical Models for the Fusion of Multiresolution Image Data. (PDF / PS)	ICCV	1995	DBLP DOI BibTeX RDF	hierarchical statistical models, multiresolution image data fusion, nonlinear hierarchical algorithms, nonlinear causal Markov models, hierarchical graph structures, bayesian estimation theory, simple hierarchical graphs, ternary graphs, single-resolution image segmentation, computational complexity, computational complexity, image processing, image segmentation, graph theory, Markov processes, sensor fusion, optimal algorithm, Bayes methods, quadtrees, bayesian estimates, random processes, estimation theory, Viterbi algorithm, low-level vision, image size
3	Gabriel Taubin	Curve and Surface Smoothing without Shrinkage. (PDF / PS)	ICCV	1995	DBLP DOI BibTeX RDF	piecewise-linear techniques, curve smoothing, scientific data visualization, multimodal medical data registration, polygonal curves, boundary-following algorithms, iso-surface construction algorithms, piecewise linear shapes, linear low-pass filter, high curvature variations, required storage, computer vision, computational complexity, computational complexity, approximation algorithms, computational geometry, topology, image registration, medical image processing, data visualisation, curve fitting, edges, faces, vertices, smoothing methods, faceting, shrinkage, polyhedral surfaces, surface smoothing
3	Y. J. Bae, Michael C. Fairhurst	Parallelism in dynamic time warping for automatic signature verification. (PDF / PS)	ICDAR	1995	DBLP DOI BibTeX RDF	automatic signature verification, mathematical optimisation, sequentially structured problems, pipeline paradigm, highly distributed network, Meiko Computing Surface, Occam2, computational complexity, computational complexity, optimisation, handwriting recognition, time complexity, dynamic time warping, time warp simulation, transputer network
3	Nicos Herodotou, Anastasios N. Venetsanopoulos, Levent Onural	Image interpolation using a simple Gibbs random field model. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	simple Gibbs random field model, downsampled version, image expansion, texture parameters, iterative GRF methods, noniterative nonlinear filtering operation, computational complexity, computational complexity, interpolation, iterative methods, estimation, image restoration, image texture, nonlinear filters, random processes, image sampling, image interpolation, spatial interpolation, image recovery
3	Dam LeQuang, André Zaccarin, S. Caron	Object-oriented coding using successive motion field segmentation and estimation. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	object oriented coding, successive motion field segmentation, block based motion compensation, moving object boundaries, object oriented video compression algorithms, motion compensated images, successive motion field estimation, object oriented coder, maximum a posteriori probability estimate, translational motion field, complex motion models, computational complexity, image segmentation, motion estimation, probability, data compression, image sequences, video coding, video coding, image matching, maximum likelihood estimation, motion compensation, simulation results, video sequences, pixels, image regions, bit rate reduction, two stage algorithm, translational motion, computational complexity reduction
3	P. K. Nanda, K. Sunil Kumar, S. Ghokale, Uday B. Desai	A multiresolution approach to color image restoration and parameter estimation using homotopy continuation method. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	multiresolution approach, color image restoration, homotopy continuation method, restoration algorithm, computational complexity, computational complexity, simulated annealing, parameter estimation, parameter estimation, Markov random field, Markov processes, image restoration, simulation results, image resolution, image colour analysis, random processes, energy function, MRF model, simulated annealing algorithm
3	Maria C. Yuang, Yu G. Chen, M. T. Yen	Optimal multicast routing for ATM networks. (PDF / PS)	LCN	1995	DBLP DOI BibTeX RDF	optimal multicast routing algorithm, LOPT, load-sensitive networks, delay-sensitive, performance evaluation, computational complexity, computational complexity, asynchronous transfer mode, ATM networks, multicast routing, telecommunication network routing, multicast communication, delay bound
3	Sungyoung Lee, Hyungill Kim, Jongwon Lee	A soft aperiodic task scheduling algorithm in dynamic-priority systems.	RTCSA	1995	DBLP DOI BibTeX RDF	soft aperiodic task scheduling algorithm, dynamic-priority systems, joint scheduling, hard deadline periodic tasks, soft deadline aperiodic tasks, fixed-critical task indicating algorithm, deadlinewise preassignment table, computational complexity, computational complexity, processor scheduling
3	Hamid K. Aghajan, Thomas Kailath	SLIDE: Subspace-Based Line Detection.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	subspace-based line detection, direction-of-arrival estimation, sensor array processing, line parameter estimation, computational complexity, computational complexity, object recognition, edge detection, parameter estimation, Hough transform, curve fitting, 3D images, array signal processing, straight lines, signal representation, SLIDE, grey-scale images
3	Xiaoping Hu, Narendra Ahuja	Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	point features, disparity constraints, intensity-based matching algorithm, heuristic tests, two-dimensional geometrical relationships, rigidity test, disparity test, epipolar line, indoor images, computational complexity, computational complexity, feature extraction, image sequences, geometry, geometric constraints, matching algorithm, rigidity constraints, feature detectors
3	Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis	Local Versus Nonlocal Computation of Length of Digitized Curves.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	nonlocal computation, length of digitized curves, inherent parallel computational complexity, digitization level, random tessellation, deterministic tessellation, parallel algorithms, computational complexity, image segmentation, image segmentation, parallel computation, computational geometry, local computation
3	Tun-Wen Pai, John H. L. Hansen	Boundary-Constrained Morphological Skeleton Minimization and Skeleton Reconstruction.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	boundary-constrained morphological skeleton minimization, boundary-constrained skeleton reconstruction, data storage requirement reduction, binary morphological skeleton, morphological boundary structure, computational complexity, computational complexity, image processing, image coding, image analysis, mathematical morphology
3	Nageswara S. V. Rao	Computational Complexity Issues in Operative Diagnosis of Graph-Based Systems.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	graph-based systems, alarm placement, fault propagation time, alarm placement problem, computational complexity, computational complexity, fault diagnosis, fault tolerant computing, NP-complete, fault propagation
3	Michael Young, David L. Levine, Richard N. Taylor	Comments on ``Temporal Logic-Based Deadlock Analysis for Ada''.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	temporal logic-based deadlock analysis, axiomatic proof method, event-based models, computational complexity, computational complexity, Ada, Ada, temporal logic, concurrency control, nondeterminism, symbolic manipulation, symbol manipulation, state-based models
3	James S. Duncan, Thomas Birkhölzer	Reinforcement of Linear Structure using Parametrized Relaxation Labeling.	IEEE Trans. Pattern Anal. Mach. Intell.	1992	DBLP DOI BibTeX RDF	linear structure reinforcement, label strength, information suppression, neighbourhood influence biassing, bar reinforcement, line segment reinforcement, parametrized relaxation labeling, local evidence, orientation labels, sigmoidal thresholding function, noise-suppressed labelings, edge reinforcement, computational complexity, computational complexity, picture processing, convergence, thinning, noisy images
3	S. J. Wan, S. K. Michael Wong	A Partially Supervised Learning Algorithm for Linearly Separable Systems.	IEEE Trans. Pattern Anal. Mach. Intell.	1992	DBLP DOI BibTeX RDF	partially supervised learning, linearly separable systems, computational complexity, computational complexity, learning (artificial intelligence), lower bound
3	Mahdi Abdelguerfi, Arun K. Sood	Computational Complexity of Sorting and Joining Relations with Duplicates.	IEEE Trans. Knowl. Data Eng.	1991	DBLP DOI BibTeX RDF	duplicate values, attribute columns, distinct tuple values, multirelation, distinct elements, worst time complexity, binary comparisons, three-branch comparisons, natural join operation, computational complexity, computational complexity, relational databases, lower bounds, sorting, sorting, database theory, upper bounds, relations, joining, cardinality
3	Amir Averbuch, Samuel Itzikowitz, Tal Kapon	Parallel Implementation of Multiple Model Tracking Algorithms.	IEEE Trans. Parallel Distrib. Syst.	1991	DBLP DOI BibTeX RDF	interacting multiple model algorithm, multiple model tracking, parallel algorithms, parallel algorithms, computational complexity, computational complexity, parallel implementation, MIMD, Viterbi algorithm, computerised signal processing
3	Albert C. Chen, Chuan-lin Wu	A Parallel Execution Model of Logic Programs.	IEEE Trans. Parallel Distrib. Syst.	1991	DBLP DOI BibTeX RDF	parallel execution model, nondeterministic logic program, frame inheritance, dynamic construction, computational complexity, computational complexity, logic programs, logic programming, modularity, communication channels, OR parallelism, AND parallelism, data-dependency graphs
3	Wesley W. Chu, Chi-Man Sit, Kin K. Leung	Task Response Time For Real-Time Distributed Systems With Resource Contentions.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	task response times, extended queuing network model, module response times, weighted control-flow graph model, task response time, invocation rates, module assignments, real-time systems, computational complexity, computational complexity, graph theory, resource allocation, distributed processing, queueing theory, analytic model, simulation results, interprocessor communications, scheduling policies, resource contentions, decomposition technique, real-time distributed systems, submodels, distributed processing systems
3	Gerald M. Karam, Raymond J. A. Buhr	Temporal Logic-Based Deadlock Analysis For Ada.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	temporal logic-based specification language, deadlock analyzer, Timebench, concurrent system-design environment, COL, linear-time temporal logic, formal basis, axiomatic reasoning, deadlock analysis tool, reasoning power, Ada designs, systemwide deadlock-free, deadlock algorithm, finite systems, worst-case computational complexity, gas station, layered communications system, computational complexity, Ada, logic programming, temporal logic, Prolog, specification language, specification languages, inference mechanisms, system recovery, theorem prover, readers, dining philosophers, writers
3	Yujiun P. Wang, Theodosios Pavlidis	Optimal Correspondence of String Subsequences.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	string-to-string subsequence, string-to-regular-expression subsequence, string subsequences, optimal correspondent subsequence, finite alphabet editing error minimization matching, infinite alphabet penalty minimization matching, syntactic information, stereo epipolar line matching problem, UPC bar-code recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar
3	Ashok K. Goel, Tom Bylander	Computational Feasibility of Structured Matching.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	decision-making problems, pattern recognition, pattern recognition, computational complexity, computational complexity, knowledge engineering, knowledge engineering, hierarchical structure, structured matching
3	Francesco Bergadano, Attilio Giordana, Lorenza Saitta	Automated Concept Acquisition in Noisy Environments.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	automated concept acquisition, learning methodology, discriminant descriptions, clusters, machine learning, pattern recognition, computational complexity, computational complexity, artificial intelligence, artificial intelligence, speech recognition, speech recognition, knowledge acquisition, knowledge engineering, knowledge engineering, learning systems, formal logic, graph structure, noisy environments
3	Hiroshi Noborio, Shozo Fukuda, Suguru Arimoto	Construction of the Octree Approximating a Three-Dimensional Object by Using Multiple Views.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	polyhedral cones, octree representation, polygonal contour, hierarchical description, resolution level, computational complexity, computational complexity, computerised picture processing, computerised pattern recognition, trees (mathematics), nodes, computerized pattern recognition, computerized picture processing, 3-D objects
3	Sakti Pramanik, David Vineyard	Optimizing Join Queries in Distributed Databases.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	reduced cover set, acyclic query graph, partial order graph, minimum response time, optimization, computational complexity, computational complexity, graph theory, distributed databases, distributed database, distributed databases, optimisation, database theory, concurrent processing, join queries
2	Prabhu Manyem, Julien Ugon	Computational Complexity, NP Completeness and Optimization Duality: A Survey.	Electronic Colloquium on Computational Complexity (ECCC)	2012	DBLP BibTeX RDF
2	Scott Aaronson	Why Philosophers Should Care About Computational Complexity.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
2	Yang Li	Monotone Rank and Separations in Computational Complexity.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
2	Dieter van Melkebeek	Special Issue "Conference on Computational Complexity 2010" Guest Editor's Foreword.	Computational Complexity	2011	DBLP DOI BibTeX RDF
2		Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011	IEEE Conference on Computational Complexity	2011	DBLP BibTeX RDF
2	Russell Impagliazzo	Relativized Separations of Worst-Case and Average-Case Complexities for NP.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Zohar Shay Karnin, Yuval Rabani, Amir Shpilka	Explicit Dimension Reduction and Its Applications.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Neeraj Kayal, Chandan Saha	On the Sum of Square Roots of Polynomials and Related Problems.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Sevag Gharibian, Julia Kempe	Approximation Algorithms for QMA-Complete Problems.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Venkatesan Guruswami	Linear-Algebraic List Decoding of Folded Reed-Solomon Codes.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Yuichi Yoshida	Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Lorenzo Carlucci, Nicola Galesi, Massimo Lauria	Paris-Harrington Tautologies.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan	Symmetric LDPC Codes are not Necessarily Locally Testable.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Hartmut Klauck	On Arthur Merlin Games in Communication Complexity.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Andrew Drucker	Improved Direct Product Theorems for Randomized Query Complexity.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Xin Li	A New Approach to Affine Extractors and Dispersers.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Shachar Lovett, Emanuele Viola	Bounded-Depth Circuits Cannot Sample Good Codes.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Anindya De	Pseudorandomness for Permutation and Regular Branching Programs.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Shubhangi Saraf, Sergey Yekhanin	Noisy Interpolation of Sparse Polynomials, and Applications.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Ryan O'Donnell, Yi Wu, Yuan Zhou	Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich	Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Amir Shpilka, Avishay Tal	On the Minimal Fourier Degree of Symmetric Boolean Functions.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Marius Zimand	Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Arkadev Chattopadhyay, Shachar Lovett	Linear Systems over Finite Abelian Groups.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland	Symmetry-Assisted Adversaries for Quantum State Generation.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf	Near-Optimal and Explicit Bell Inequality Violations.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Daniel M. Kane	k-Independent Gaussians Fool Polynomial Threshold Functions.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Xin Li	Improved Constructions of Three Source Extractors.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Paul Beame, Widad Machmouchi	Making Branching Programs Oblivious Requires Superlogarithmic Overhead.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Eli Ben-Sasson, Michael Viderman	Towards Lower Bounds on Locally Testable Codes via Density Arguments.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Ryan Williams	Non-uniform ACC Circuit Lower Bounds.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Boris Alexeev, Michael A. Forbes, Jacob Tsimerman	Tensor Rank: Some Lower and Upper Bounds.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Jin-yi Cai, Xi Chen, Pinyan Lu	Non-negatively Weighted #CSP: An Effective Complexity Dichotomy.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
2	Eric Blais, Joshua Brody, Kevin Matulef	Property Testing Lower Bounds via Communication Complexity.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF