The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase computational complexity (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1964-1971 (18) 1972-1974 (19) 1975-1976 (23) 1977-1978 (21) 1979-1980 (22) 1981-1982 (32) 1983 (16) 1984 (15) 1985-1986 (62) 1987 (53) 1988 (76) 1989 (95) 1990 (119) 1991 (109) 1992 (115) 1993 (112) 1994 (179) 1995 (213) 1996 (137) 1997 (147) 1998 (110) 1999 (163) 2000 (217) 2001 (241) 2002 (260) 2003 (321) 2004 (431) 2005 (602) 2006 (737) 2007 (766) 2008 (827) 2009 (449) 2010 (147) 2011 (113) 2012 (103) 2013 (110) 2014 (121) 2015 (115) 2016 (110) 2017 (127) 2018 (122) 2019 (127) 2020 (132) 2021 (140) 2022 (119) 2023 (2)
Publication types (Num. hits)
article(2666) book(20) incollection(94) inproceedings(5410) phdthesis(58) proceedings(47)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 8417 occurrences of 3539 keywords

Results
Found 8295 publication records. Showing 8295 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
48Liming Cai, Jianer Chen, Johan Håstad Circuit Bottom Fan-in and Computational Power. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF computational complexity, lower bound, circuit complexity, alternating Turing machine
45R. Elijah Blessing, V. Rhymend Uthariaraj Evaluation and Analysis of Computational Complexity for Secure Multicast Models. Search on Bibsonomy ICCSA (2) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF LeaSel, security, computational complexity, scalability, Multicast, encryptions, key distribution
45Gabriel Istrate Computational Complexity and Phase Transitions. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
44Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? Search on Bibsonomy Computational Complexity Conference The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
44Lance Fortnow The History of Complexity. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Computational Complexity, History of Computing
44Daniele Micciancio Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2002 DBLP  DOI  BibTeX  RDF worst-case/average-case connection, computational complexity, cryptography, hash functions, lattices
44Beate Bollig, Martin Sauerhoff, Ingo Wegener On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs
44Marcus Schaefer 0001 Deciding the K-Dimension is PSPACE-Complete. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2000 DBLP  DOI  BibTeX  RDF computational complexity, learning theory, PSPACE
44Jack Jie Dai, Jack H. Lutz Query Order and NP-Completeness. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1999 DBLP  DOI  BibTeX  RDF query order, resource-bounded genericity, computational complexity, NP-completeness, complexity classes, resource-bounded measure
44Klaus Ambos-Spies, Levke Bentzien Separating NP-Completeness Notions under Strong Hypotheses. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF NP-completeness notions separation, strong hypotheses, NP-m-completeness, NP-T-completeness, bounded-query reducibilities, resource bounded Baire category concept, computational complexity, resource bounded measure
44László Babai, Peter G. Kimmel Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF randomized simultaneous messages, two-player communication model, deterministic SM complexity, quadratic reduction, lower bound proof, computational complexity, communication complexity, linear algebra
44Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin Inequalities for Shannon entropies and Kolmogorov complexities. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF finite objects, Ingleton's inequality, Gacs-Korner's results, computational complexity, Kolmogorov complexities, Shannon entropies, linear inequalities
44Sanjeev Khanna, Madhu Sudan 0001, Luca Trevisan Constraint Satisfaction: The Approximability of Minimization Problems. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF complete problems, computational classes, computational complexity, Approximation algorithms, combinatorial optimization
44Manindra Agrawal, Eric Allender, Samir Datta On TC0, AC0, and Arithmetic Circuits. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF TC/sup 0/, AC/sup 0/, function classes, constant-depth polynomial-size arithmetic circuits, unbounded fanin addition, multiplication gates, constant-depth arithmetic circuits, computational complexity, normal forms, arithmetic circuits, closure properties
44Jack H. Lutz, Yong Zhao The Density of Weakly Complete Problems under Adaptive Reductions. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF dense languages, polynomial reductions, sparse languages, weak completeness, computational complexity, complexity classes, resource-bounded measure
44Pierluigi Crescenzi A Short Guide to Approximation Preserving Reductions. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF approximation preserving reductions, computational complexity, complexity, combinatorial optimization
44Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov Complexity and Expressive Power of Logic Programming. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF computational complexity, Logic programming, resolution, constraint logic programming, unification, expressive power
44Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer Nondeterministic NC1 Computation. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF nondeterministic Turing machine, leaf language, Computational complexity, circuit
44Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers Inverting Onto Functions. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF function classes, total functions, nondeterministic Turing machines, unambiguous computation, Computational complexity, invertibility
44Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer Complements of Multivalued Functions. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF multivalued functions, NPMV functions, coNPMV, complete functions, query hierarchy, functional analogue, Boolean hierarchy, computational complexity, complexity, multivalued logic, polynomial time hierarchy
44Helmut Veith Succinct Representation, Leaf Languages, and Projection Reductions. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF leaf languages, quantifier-free reductions, computational complexity, descriptive complexity, succinct representation
44Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney L-Printable Sets. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF printability, logspace, rankability, computational complexity
44Christos H. Papadimitriou The Complexity of Knowledge Representation. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity, complexity, artificial intelligence, artificial intelligence, knowledge representation, knowledge representation, complexity theory, common-sense reasoning, common-sense reasoning
44Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay DNA Models and Algorithms for NP-complete Problems. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF 3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems
44Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik On Coherence, Random-self-reducibility, and Self-correction. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF self-correctability, random-self-reducibility, polynomial advice, adaptive versus nonadaptive oracle machines, Computational complexity, coherence, Kolmogorov complexity
44Rainer Schuler Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity, completeness, average-case analysis, resource-bounded measure
44Yongge Wang The Law of the Iterated Logarithm for p-Random Sequences. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF The law of the iterated logarithm, computational complexity, randomness
44Marcus Schäfer 0001 Deciding the Vapnik-Cervonenkis dimension is SigmaP3-complete. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity, VC dimension
44Ker-I Ko, Klaus Weihrauch On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Lebesgue measure, two-dimensional region, polynomial-time computable boundary, interior region, polynomial-time computable, computational complexity, computability, computability, Turing machines
44Dieter van Melkebeek Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity theory, sparse hard set problem for P
44Noam Nisan Extracting Randomness: How and Why A survey. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Randmoness, Computational Complexity, Derandomization, Expanders
41Danny Nguyen, Igor Pak The Computational Complexity of Integer Programming with Alternations. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
41Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans 09421 Abstracts Collection - Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2009 DBLP  BibTeX  RDF
41Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans 09421 Executive Summary - Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2009 DBLP  BibTeX  RDF
41Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek 08381 Executive Summary - Computational Complexity of Discrete Problems. Search on Bibsonomy Computational Complexity of Discrete Problems The full citation details ... 2008 DBLP  BibTeX  RDF
41Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek 08381 Abstracts Collection - Computational Complexity of Discrete Problems. Search on Bibsonomy Computational Complexity of Discrete Problems The full citation details ... 2008 DBLP  BibTeX  RDF
41Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2007 DBLP  BibTeX  RDF
41Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf 07411 Executive Summary -- Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2007 DBLP  BibTeX  RDF
41Harry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns Towards a Predictive Computational Complexity Theory. Search on Bibsonomy Computational Complexity and Statistical Physics The full citation details ... 2006 DBLP  BibTeX  RDF
41Harry Buhrman, Lance Fortnow, Thomas Thierauf 04421 Abstracts Collection - Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2004 DBLP  BibTeX  RDF
39Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf On Computation and Communication with Small Bias. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Jun (Jim) Xu, Richard J. Lipton On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF quality of service, computational complexity, decision tree, packet scheduling, delay bound
39Jun (Jim) Xu, Richard J. Lipton On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. Search on Bibsonomy SIGCOMM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF quality of service, computational complexity, decision tree, packet scheduling, delay bound
38André Berthiaume, Wim van Dam, Sophie Laplante Quantum Kolmogorov Complexity. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2000 DBLP  DOI  BibTeX  RDF data compression, information theory, quantum computation, Kolmogorov complexity, quantum information theory
37Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001 The Complexity of the Covering Radius Problem on Lattices and Codes. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Rocco A. Servedio, Steven J. Gortler Quantum versus Classical Learnability. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
37Larry J. Stockmeyer, Dharmendra S. Modha Links Between Complexity Theory and Constrained Block Coding. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
37Thanh Minh Hoang, Thomas Thierauf The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
36 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  BibTeX  RDF
36Manindra Agrawal On Derandomizing Tests for Certain Polynomial Identities. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Emanuele Viola Hardness vs. Randomness within Alternating Time. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Navin Goyal, Michael E. Saks, Srinivasan Venkatesh 0001 Optimal Separation of EROW and CROWPRAMs. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Howard Barnum, Michael E. Saks, Mario Szegedy Quantum query complexity and semi-definite programming. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Richard Beigel, Lance Fortnow Are Cook and Karp Ever the Same? Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang Disjoint NP-Pairs. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Venkatesan Guruswami List Decoding with Side Information. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Andrei E. Romashchenko Extracting the Mutual Information for a Triple of Binary Strings. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Wolfgang Merkle The complexity of stochastic sequences. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Ke Yang, Avrim Blum On Statistical Query Sampling and NMR Quantum Computing. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Albert Atserias, Víctor Dalmau A Combinatorial Characterization of Resolution Width. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Oded Regev 0001 Improved Inapproximability of Lattice and Coding Problems with Preprocessing. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Yijia Chen, Jörg Flum, Martin Grohe Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Johan Håstad Inapproximability Some history and some open problems. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind Memoization and DPLL: Formula Caching Proof Systems. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Russell Impagliazzo, Philippe Moser A zero one law for RP. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Lance Fortnow, Aduri Pavan, Samik Sengupta Proving SAT does not have Small Circuits with an Application to the Two. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Ryan O'Donnell, Rocco A. Servedio Extremal properties of polynomial threshold functions. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel Universal Languages and the Power of Diagonalization. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Rahul Santhanam, Dieter van Melkebeek Holographic Proofs and Derandomization. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Amit Chakrabarti, Subhash Khot, Xiaodong Sun Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Hartmut Klauck Rectangle Size Bounds and Threshold Covers in Communication Complexity. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Pranab Sen Lower bounds for predecessor searching in the cell probe model. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Eric Allender, Michal Koucký 0001, Detlef Ronneburger, Sambuddha Roy Derandomization and Distinguishing Complexity. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Detlef Sieling Minimization of Decision Trees Is Hard to Approximate. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Subhash Khot, Oded Regev 0001 Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Jonas Holmerin, Subhash Khot A Strong Inapproximability Gap for a Generalization of Minimum Bisection. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Scott Aaronson Quantum Certificate Complexity. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Lars Engebretsen, Jonas Holmerin Three-Query PCPs with Perfect Completeness over non-Boolean Domains. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Nageswara S. V. Rao Computational Complexity Issues in Operative Diagnosis of Graph-Based Systems. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 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
36Mahdi Abdelguerfi, Arun K. Sood Computational Complexity of Sorting and Joining Relations with Duplicates. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 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
36Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia Tight Lower Bounds for Certain Parameterized NP-Hard Problems. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices. Search on Bibsonomy RTCSA The full citation details ... 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
34Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multi-prover interactive proof systems, quantum nonlocality, Tsirelson inequality, entanglement
34Pavel Pudlák Godel and Computations (Abstract). Search on Bibsonomy Computational Complexity Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Uriel Feige, Daniele Micciancio The Inapproximability of Lattice and Coding Problems with Preprocessing. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
34Mikael Goldmann, Alexander Russell The Complexity of Solving Equations over Finite Groups. Search on Bibsonomy Computational Complexity Conference The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilkerson Measuring empirical computational complexity. Search on Bibsonomy ESEC/SIGSOFT FSE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF empirical computational complexity, trend-prof
33Arnold Beckmann A Note on Universal Measures for Weak Implicit Computational Complexity. Search on Bibsonomy LPAR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
32Syed Sajjad Rizvi, Aasia Riasat, Khaled M. Elleithy Transformation Matrix System for Reducing the Computational Complexity of Wireless Multi-User Receivers for DS-CDMA Systems. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multiuser Communications, Computational Complexity, DS-CDMA, Transformation Matrix
32Ireneusz Karkowski Architectural synthesis with possibilistic programming. Search on Bibsonomy HICSS (1) The full citation details ... 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
32Amir Averbuch, Samuel Itzikowitz, Tal Kapon Parallel Implementation of Multiple Model Tracking Algorithms. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 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
31Daniel Leivant Intrinsic Theories and Computational Complexity. Search on Bibsonomy LCC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
31Robert L. Constable Expressing Computational Complexity in Constructive Type Theory. Search on Bibsonomy LCC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
31Valentine Kabanets (eds.) 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference). Search on Bibsonomy Computational Complexity Conference The full citation details ... 2021 DBLP  BibTeX  RDF
31William Cole Franks, Philipp Reichenbach Barriers for Recent Methods in Geodesic Optimization. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
31Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov 0001 The Power of Negative Reasoning. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
31Anastasia Sofronova, Dmitry Sokolov 0001 Branching Programs with Bounded Repetitions and Flow Formulas. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
31Vishnu Iyer, Avishay Tal, Michael Whitmeyer Junta Distance Approximation with Sub-Exponential Queries. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 8295 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license