On polynomial time bounded truth-table reducibility of NP sets to sparse sets
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
PP is closed under intersection
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
Lower bounds for the low hierarchy
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Customizing information capture and access
ACM Transactions on Information Systems (TOIS)
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Reducing the complexity of reductions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Discontinuities in recurrent neural networks
Neural Computation
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers
Designs, Codes and Cryptography
Computing with continuous-time Liapunov systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Theoretical Computer Science - Algorithmic learning theory
Calculs sur les structures de langage dénombrable
Theoretical Computer Science
A study of homogeneity in relational databases
Annals of Mathematics and Artificial Intelligence
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
On the Construction of Effective Random Sets
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the Structure of the Simulation Order of Proof Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Generalized Graph Colorability and Compressibility of Boolean Formulae
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Strong Reductions and Immunity for Exponential Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Universally Polynomial Context-Free Languages
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Structural Properties of One-way Hash Functions
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
The Root of a Language and Its Complexity
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Minimal Covers of Formal Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
If P != NP Then Some Strongly Noninvertible Functions Are Invertible
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
From Theoretical Learnability to Statistical Measures of the Learnable
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Continuous-time symmetric Hopfield nets are computationally universal
Neural Computation
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Information and Computation
Refining nondeterminism below linear time
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Alternating and empty alternating auxiliary stack automata
Theoretical Computer Science
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Acceptance by Transformation Monoids (with an Application to Local Self Reductions)
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
LR(k) Testing is Average Case Complete
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
P-immune sets with holes lack self-reducibility properties
Theoretical Computer Science
Optimal proof systems imply complete sets for promise classes
Information and Computation
Inequality of finite behaviors of rational weight finite automata is in R
Information Processing Letters
Upper bounds on ATSP neighborhood size
Discrete Applied Mathematics
Fast computation of discrete invariants associated to a differential rational mapping
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998
Journal of the ACM (JACM)
The complexity of tensor calculus
Computational Complexity
Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes
Fundamenta Informaticae
Average-case intractability vs. worst-case intractability
Information and Computation
Relativized collapsing between BPP and PH under stringent oracle access
Information Processing Letters
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Experience, generations, and limits in machine learning
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Tantrix TM rotation puzzles are intractable
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Reasoning about evolving nonmonotonic knowledge bases
ACM Transactions on Computational Logic (TOCL)
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An optical model of computation
Theoretical Computer Science
Further Extension of the TSP Assign Neighborhood
Journal of Heuristics
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science - Mathematical foundations of computer science 2004
A reducibility for the dot-depth hierarchy
Theoretical Computer Science - Mathematical foundations of computer science 2004
Languages to diagonalize against advice classes
Computational Complexity
On the typical case complexity of graph optimization
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Resource bounded immunity and simplicity
Theoretical Computer Science
A note on the circuit complexity of PP
Theoretical Computer Science
The P ≠ NP conjecture in the context of real and complex analysis
Journal of Complexity
Computing queries with higher-order logics
Theoretical Computer Science - Logic, language, information and computation
On approximate learning by multi-layered feedforward circuits
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
If P ≠ NP then some strongly noninvertible functions are invertible
Theoretical Computer Science
Parallel algorithms for separable permutations
Discrete Applied Mathematics
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Baire categories on small complexity classes and meager--comeager laws
Information and Computation
The computational power of discrete hopfield nets with hidden units
Neural Computation
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
Theoretical Computer Science
Computational Complexity
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
On the Complexity of Equilibria Problems in Angel-Daemon Games
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Characterisation of NL Using Membrane Systems without Charges and Dissolution
UC '08 Proceedings of the 7th international conference on Unconventional Computing
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Universal relations and #P-completeness
Theoretical Computer Science
Verification of qualitative Z constraints
Theoretical Computer Science
How Redundant Is Your Universal Computation Device?
Membrane Computing
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
Finding Alternatives Web Services to Parry Breakdowns
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
Structural properties of oracle classes
Information Processing Letters
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Complexity of prioritized default logics
Journal of Artificial Intelligence Research
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
A theory of average-case compilability in knowledge representation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity of probabilistic planning under average rewards
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the existence of secure feedback registers
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Flip-pushdown automata: k + 1 pushdown reversals are better than k
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Sparse sets, approximable sets, and parallel queries to NP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Active membrane systems without charges and using only symmetric elementary division characterise P
WMC'07 Proceedings of the 8th international conference on Membrane computing
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Assisted problem solving and decompositions of finite automata
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the complexity of measurement in classical physics
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Limits to measurement in experiments governed by algorithms†
Mathematical Structures in Computer Science
Measuring 4-local qubit observables could probabilistically solve PSPACE
Quantum Information & Computation
Complexity issues for preorders on finite labeled forests
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
On the computational complexity of behavioral description-based web service composition
Theoretical Computer Science
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
The complexity of black-box ring problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Universal relations and #p-completeness
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Generic density and small span theorem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Relations between average-case and worst-case complexity
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Complexity of continuous space machine operations
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computer Science Review
Characterizations and Existence of Easy Sets without Hard Subsets
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On centralized PC grammar systems with context-sensitive components
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
Fundamenta Informaticae
Reductions to the set of random strings: the resource-bounded case
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Symmetry of information and nonuniform lower bounds
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Entanglement and the complexity of directed graphs
Theoretical Computer Science
Functions Computable with Nonadaptive Queries to NP
Theory of Computing Systems
| Hi-index | 0.01 |