SIGACT News complexity theory column 32
ACM SIGACT News
The complexity of solving equations over finite groups
Information and Computation
Inapproximability Results for Equations over Finite Groups
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Learning Expressions over Monoids
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Algebraic Characterizations of Small Classes of Boolean Functions
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Equation Satisfiability and Program Satisfiability for Finite Monoids
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The computing power of programs over finite monoids
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Inapproximability results for equations over finite groups
Theoretical Computer Science - Special issue on automata, languages and programming
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
Learning expressions and programs over monoids
Information and Computation
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Learning expressions and programs over monoids
Information and Computation
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
An algebraic perspective on Boolean function learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Learning read-constant polynomials of constant degree modulo composites
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Typed monoids: an Eilenberg-like theorem for non regular languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
An algebraic view on exact learning from queries
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.00 |