Computational complexity theory
ACM Computing Surveys (CSUR)
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
Scalar Aggregation in FD-Inconsistent Databases
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Finite Automata with Generalized Acceptance Criteria
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Complexity of Computing the Size of an Interval
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Inapproximability Results for Guarding Polygons without Holes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Optimization Problems Categories
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Stability of Approximation Algorithms for Hard Optimization Problems
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Distributed Simulation with Cellular Automata: Architecture and Applications
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
If P != NP Then Some Strongly Noninvertible Functions Are Invertible
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of arc-colorings for directed hypergraphs
Discrete Applied Mathematics
On the complexity of vertex-disjoint length-restricted path problems
Computational Complexity
Optimal covering designs: complexity results and new bounds
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
If P ≠ NP then some strongly noninvertible functions are invertible
Theoretical Computer Science
ACM SIGACT News
A novel method for parameter optimization in two-dimensional dynamical models
Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
The Complexity of Power-Index Comparison
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Polynomial reduction of time-space scheduling to time scheduling
Discrete Applied Mathematics
Other complexity classes and measures
Algorithms and theory of computation handbook
Computational Complexity in Non-Turing Models of Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
On some complexity issues of NC analytic functions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Separating the notions of self- and autoreducibility
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Tight approximability results for the maximum solution equation problem over Zp
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
An alternating hierarchy for finite automata
Theoretical Computer Science
| Hi-index | 0.00 |