Skip to main content
Theoretical Computer Science
EXPTIME-complete's user avatar
EXPTIME-complete's user avatar
EXPTIME-complete's user avatar
EXPTIME-complete
  • Member for 10 years, 4 months
  • Last seen more than a month ago
  • Universidad Complutense de Madrid, Madrid, Spain
Profile Activity

Stats

438
reputation
3k
reached
4
answers
9
questions
Communities

About

I'm Ismael Rodríguez, associate professor in Dpt. Sistemas Informáticos y Computación, Fac. Informática, Universidad Complutense de Madrid. My topics of research include computational complexity, heuristic and evolutionary algorithms, and formal methods in testing. Recently I've been particularly interested in circuit complexity and the PCP theorem.

Badges

View all badges
This user doesn’t have any gold badges yet.
2
silver badges
11
bronze badges

Top tags

View all tags
3
Score
8
Posts
62
Posts %
3
Score
6
Posts
46
Posts %
3
Score
6
Posts
46
Posts %
2
Score
2
Posts
15
Posts %
2
Score
1
Posts
8
Posts %
2
Score
1
Posts
8
Posts %

Top posts

View all questions and answers
7
Impossibility in Computability and Complexity: always ultimately due to diagonal arguments?
Nov 17, 2017
4
Looking for approximation class between NPO and Exp-APX
Apr 6, 2017
4
(PCP theorem) Any natural decision problem defined in the format of PCP-verifiers?
Aug 19, 2022
3
Which is the approximation class of Minimum 0-1 integer programming if only non-negative integers are allowed?
Dec 30, 2015
3
Is there any known Poly-APX-complete minimimization problem?
Oct 12, 2017
3
Approximation class of finding decision trees with minimal depth
Nov 13, 2017
2
Is there any known Poly-APX-complete minimimization problem?
Nov 15, 2017
2
What is the current state of the art on exact identification of DFAs with a maximum N states
Jan 10, 2024
1
Does the NP-hardness of finding any valid solution imply NPO-hardness?
Jan 25, 2018
1
Looking for an implementation of any PCP-verifier for any NP problem
Jul 30, 2022